ALGORITHM Secret (A[0..n - 1]) // Input: An array A[0..n - 1] of integer numbers if n = 1 return A[0] else Consider the following recursive algorithm: temp Secret (A[0..n - 2]) if temp A[n 1] return temp else return A[n 1] = a) [10 points] What does this algorithm compute? Activate Windows b) [20 points] Set up a recurrence relation for the algorithm's running time and solve it.