(a) given a sorted array of n distinct integers that has been rotated an unknown number of times. implement (in java) an efficient algorithm that finds an element in the array. (b) what is the running time complexity of your algorithm? note: you may assume that the array was originally sorted in increasing order. example: input: find 5 in array (15 16 19 20 25 1 3 4 5 7 10 14) output: 8 (the index of 5 in the array)