Using Java please

1. Consider the following method. What is the basic operation? What is its time complexity? What is its order? How did you come to these conclusions? 2. Consider the following algorithm for finding the distance between the two closest numbers in an array. (Note: the distance between two numbers a and b is measured by ab) Make as many improvements as you can to speed up its performance: 3. Define a method named 'reverse' which takes an array as an argument. This method should reverse the elements in the array (note: do not use any preexisting methods such as Collections.reverse() to accomplish this). If you pass the array {1,2,3,4} to your method it should be changed to {4,3,2,1} and {5,4,2,3,1} should be changed to {1,3,2,4,5}, etc. You are free to write your method however you like. After you have run and tested your method, write a comment at the top of your file analyzing the method's performance. What is its time complexity and how did you determine this