Write a pseudocode for a divide-and-conquer algorithm for finding the position of the largest element in an array of n numbers. Q5. Consider the following Divide and Conquer algorithm on an array A[0..n-1] of integers Algorithm Guess What (A, low, high) if low high then else return A[low] mid L (low high)/2J return Guess What (A, low, mid) +Guess What (A, mid-1, high) end if a. What does the algorithm do when called by Guess What (4, 0, n-1)? b. Indicate the statements of this algorithm that correspond to the divide, conquer, and combine steps.