Problem 7 (20 points): You are given a sorted array of n unique integers in decreasing order (i.e. from largest number at index 0 to smallest number at index n1), implement an O(log(n)) recursive algorithm in Java to search for a value, k. Prove that your algorithm is O(log(n)) by writing the recurrence T(n) and solving by Master Theorem. You may use -notation to represent the number of basic ops performed at each recursive call. Use the below method signature when implementing your algorithm. Feel free to implement additional helper methods, if needed. However, if you have helper methods, please use code comments to explain what the helper method is doing