The following represents pseudocode for the function maxVal( A, first, last) that returns the maximum value within A [first..last]. Assuming in general that A is an array with n elements, then the function call maxVal(A,1,n) would return the maximum value in the entire array. maxVal(A, first,last ) best =A[ first ] for i= first +1 to last if A[i]> best best =A[i] return best and of course the time cost T(n) for the function is (n). Write a divide and conquer version of maxVal. In writing your solution you may assume the existence of a function max(X,Y) that returns the maximum of the two numbers X and Y in time (1). In addition, specify the recurrence equation for T(n) for maxVal, and solve the recurrence equation to provide asymptotic upper and lower bounds for T(n). Are the bounds the same as the iterative version? (20 points)