The algorithm RECURSIVE-MIN computes the minimum value in an array A of length A.length: RECURSIVE-MIN (A) : n = A.length if n == 1 return [1] else p = RECURSIVE-MIN (A[2..n]). return MIN (A[1], p) // two-argument MIN function a. Derive a recurrence relation for the running time of RECURSIVE-MIN. b. Use a recursion tree to guess" an asymptotic upper bound on the running time. C. Use the substitution method to prove that your guess is correct