Q4. Suppose you are given an array A of n sorted numbers that has been circularly shifted to the right by k positions. For example {35, 42, 5, 15, 27, 29} is a sorted array that has been circularly shifted k=2 positions, while {27, 29, 35, 42, 4, 15} has been shifted k=4 positions. (a) Give an O(log n) pseudocode to find the largest number in A. You may assume the elements of A are distinct. (10 points) (b) Write the recurrence for your algorithm and show that its recurrence solves to O(log n) (using the Master Method). (5 points)