Consider the following recursive algorithm that computes minimum value out of real numbers stored in the array A on positions from to r PUZZLE(A: array of real numbers, I: integer, r: integer) if I=r then return A[l] + r tempi 1 ) PUZZLE(A 1 l+r if temp, temp2 then return temp, return temps Write a recurrence describing the cost of running this algorithm on n element array: PUZZLE(A,I,n). Solve the recurrence and give the resulting running time of the algorithm