1. Write a method, called isSorted, that takes an array of integers as input, and returns true if the array is sorted in ascending order (e.g., [2,3,7,8,22,59]), and false otherwise.

2. Write a method, called find, that takes and array of integers a and an integer x as input, and returns true if x is in a

3. Write a method, called second Min, that takes an array of integers as input, and finds the second smallest element of the array. (Debug hint: once you finish writing your code, test it on array {10,1,2,3,4} and see if the result is correct)

In java and can you please explain how to do each one.