Suppose you are given an array ...n of distinct sorted integers that has been circularly shifted k positions to the right. For example, [31, 40, 4, 11, 24, 28] is a sorted array that has been circularly shifted k = 2 positions, while [24, 28, 31, 40, 4, 11) has been shifted k = 4 positions. We can obviously find the largest element in A in O(n) time. Give an O(logn) algorithm to find the largest number in A