Problem 5: A geologist has collected a sample of n mountain peak lengths and arranged them in an array "a..n]" so that "a" is a unimodal array. A unimodal array "a" is an array that has index p so that the subarray a[ 1...p] is ascendingly sorted and the subarray alp...n] is descending sorted, so a[p] is the maximum element. All the mountain peaks lengths are distinct. Find the peak index p in logarithmic time. Write the algorithm pseudo code and analyze its runtime complexity