A peak element in an array is an element that is greater than its neighbours (note that the peak element can occur at either end of the array). Write a (log n) Divide & Conquer algorithm that finds the a peak element in an array A of n elements (Note: there can be more than one peak element; for example in [4,8,3,7,5,6,9] the elements 8, 7, 9 are peaks. Your algorithm should find any of these peaks)