2) Define a k-shifted array (k 2 1) as a sorted array whose last k elements have been shifted to the front. (example: 16 23 42 0 4 8 15 (k = 3)) a. Give an algorithm that finds the maximum value in a k-shifted array A in O(1) time given A and k. b. Give an algorithm that finds the maximum given A but not k (3 points). Analyze the time complexity of your algorithm in terms of both k and n (2 points) c. Unless you already did for "b.", give an algorithm that finds the maximum in Oflog n) time (2 points). d