Consider the following recursive algorithm where the input A [0, n - 1] is an array of n real numbers ALGORITHM R(A[0..n - 1]) if n = 1 return A[0] else temp leftarrow R(A[0..n - 2]) if temp greaterthanorequalto A[n - 1] return temp else return A[n - 1] What does this algorithm compute? What is its basic operation of this algorithm? Set up a recurrence relation for the algorithm's basic operation count and solve it