Hi Experts,

This is a computer algorithm problem.

Please help. And please answer the question as detailed as possible.

Thank you so much.

1. Consider the following pseudocode if T(n) is the runtime of this code, then Algorithm: recursive Max( A, n) Input: array A of size n>=1 output: maximum element of array A -1 if n=1 T(n)- If( n-1) thern T(n-1) +2 if n>1 return A(O] time for 2 comparisons n=1? and max(a,b) else time to execute Max(A,n-1) return max(Max (A, n-1),A[n-1]) NOTE max( a,b) returns the maximum of a and b and you can find it in library Find the run-time of T(n)