Modify the FIND-MAXIMUM-SUBARRAY algorithm discussed in lecture (and Section 4.1 of CLRS) so that it works with cyclic shifts: sequences of the form Ali, Ali+1]..... An, A[1]. A[2]....A], ie, the sequence is allowed to move from the end of the array to the beginning of the array. Hint: Consider how we implemented the Max-Crossing-Subarray routine in that we knew that such a subarray must contain the elements Almid] and Amid + 1]. What two elements must a subarray containing a cyclic shift contain? Note 1: Your code should only consider cycles on the entire array A[1..n] and not cycles on subarrays in recursive calls, i.e., your code probably won't use recursion at all. Note 2: Your answer doesn't need to reproduce the pseudocode for FIND-MAXIMUM-SUBARRAY, you can simply give the pseudocode for FIND-MAXIMUM-CYCLIC-SUBARRAY to be called as follows: FIND-MAXIMUM-SUBARRAY-INCLUDING-CYCLES(A) 1 S FIND-MAXIMUM-SUBARRAY(A) = 2 S =FIND-MAXIMUM-CYCLIC-SUBARRAY(A) 3 return maximum of S, and S