O(logn) time algorithm to find two local maxima in an array

Question

Let A be an array consisting of n elements such that there exists indices i, j, k ∈[0, n−1], where 0≤ i < k < j≤n−1, and A[0]< A[1]< ... < A[i−1]< A[i]> A[i