Let X[1: n] be an array of real numbers. An entry X[k], where 1 X[k+1] ; the value

k is called in the position of the peak. The highest peak is the peak of the largest value. Note that an array may have one

peak, many peaks, or no peaks at all. a. Give a divide-and-conquer algorithm for finding the positions of all the peaks in

an input array, and analyze its time complexity. b. Give a divide-and-conquer algorithm for finding the position of the

highest peak in an input array, and analyze its time complexity.