(15 points) Consider the following recursive algorithm. Algorithm Riddle(A[O..n 1]) //Input: An array A[0..n 1] of real numbers if n=1 retur else temp Riddle(A[O..n 2]) if temp = A[n 1] return temp else return A[n 1] (a) What does this algorithm compute? (b) Set up a recurrence relation for the comparison operation at the if n = 1 in the line number 3. (c) Provide an initial condition for the recurrence relation you develop at the question (b) (d) Solve the recurrence relation using backward substitution method. Present the intermediate steps and the time complexity of the result