Consider the following recursive algorithm. Set up a recurrence relation and an initial condition for the comparison operation "if n-1" in the line number 3. [Hint: Use C(n) to indicate the number of comparisons for the array A with the size n. Then, the initial condition would be either C(1) or C(0).] Algorithm Riddle (A[0..n 1) /Input: An array A[0..n 1 of real numbers if n-1 return AO else temp Riddle(..n-2]) if temp