Problem 1 [15 points] : Suppose you are given an array of unique integers A- ai , a2, . . . , an], such that the values in A increase until reaching a peak value ap (i.e., al apti > >an). Define (in English or pseudo code) a procedure that finds the index of the peak value in A in O(log n) time. Also give a brief explanation of why your procedure is correct and runs in O(log n) time