Use java and use proper code indentation. **Exercise 3 (Verifying Sorted Order)**Create a class called `SortedOrder`. In this class, implement a method called `isOrdered` that takes as input an array of Strings and returns true if they are in sorted ascending order, and false otherwise. Test your implementation in the `main` method. Also, state the time complexity of your method implementation.**Implementation steps:**You can determine if an array is sorted in ascending order by checking if each successive element comes before the next, based on the defined comparison relation. You can compare the Strings using the `compareTo` method that returns an integer. If this integer is negative, the String on which the method is executed comes before the String specified as an actual parameter. Therefore, you can use a for loop to iterate through all Strings in the array and check if it comes before the next one (no need to check the last one). If so, return true; else (once one check becomes false), return false.

Answered: Image /qna-images/answer/9569c6db-d323-49ff-80ec-76791944720d.jpgpublic class SortedOrder{ public static boolean isOrdered(String[] arrayS) { int n = arrayS.length;//get length of string for (int i = 0; i < n - 1; ++i)//loop through all strings if (arrayS[i].compareTo(arrayS[i+1]) > 0)//if integer is positive Then return false;//return false return true;//otherwise return true if all strings are orderd } //main() method public static void main(String[] args) { String[] arrayS={"Apple","Bike"};//create array of strings System.out.println(isOrdered(arrayS));//call function and display output }}The time complexity of the given method is O(n).