6. Consider the following algorithm, answer question a-c: (10 points) Algorithm Some Algorithm(A[],n) // Input: A, an array of real numbers. n: integer that 0 A[n] Return val Else Return A[n] a) Set up a recurrence relation expressing the number of times the comparison operation at the first line (n == 0") of the algorithm is executed. b) Solve the recurrence