It is given a sorted circularIy shifted array. This is an array of sorted unique integers such that each eIement has been shifted k positions to the right with eIements wrapping around. In other words if the Iength of the array is L, the vaIue at index i in the sorted array will be at index (i+k) % L in the sorted circularIy shifted array.

Write pseudocode such that if you are given a sorted circuIarly shifted array, you wiII return the maximum eIement.

The code must run asymptotically faster than (n).