Consider the following recursive algorithm. ALGORITHM Riddle(A[O..n - 1]) Input: An array A[0..n 1] of real numbers if n = 1 return A[0] else temp + Riddle(A[0..n 2]) if temp S A[n 1] return temp else return A[n 1] a. What does this algorithm compute? b. Set up a recurrence relation for the algorithm's basic operation and solve it