Question: Consider the following recursive algorithm: min(A[0...n-1])input:an array A[0..n-1])if n=1 return A[0]else temp = MMin(A[0..n-2])if temp<=A[n-1]return tempelse return A[n-1]a) what does this algorithm compute?b)set up the recurrence relation for the algorithm basic operation and solve it.