1) Suppose you are given a non-empty array of unique integers that has been sorted, and then circularly shifted. For example, [13, 17, 19, 3, 5, 7, 11] is a sorted array that has been circularly shifted 3 positions to the right. Write a Java method that uses recursion to search the array for a target value with W.C.R.T. of O(log n). f the target value is found, the method should return the location of the value; otherwise it should return -1. 2) Suppose you are given a non-empty array in which all but 1 of the values appear in pairs that are adjacent to each other. For example, [13, 13, 17, 19, 19, 3, 3, 5, 5, 7,7,11, 11 is such an array. Write a Java method that uses recursion to search the array for the singleton value with W.C.R.T. of O(log n). The method should return the value of the singleton element (e.g. 17 in the example array above) 3) Suppose you are given a non-empty array in which all but 1 of the values appear in pairs, but now the pairs are not necessarily adjacent to each other. For example, [13, 11, 17, 19, 19, 13, 17) is such an array. Write a Java method to search the array for the singleton value with W.C.R.T. of O(n) and 0(1) space. The method should return the value of the singleton element (e.g. 11 in the example array above)