Consider the psuedo code and Find the run time of T(n). on the right hand side, find the time or big-O run time to execute Max(A,n-1) tike for 2. Comparisons n=1? and max(a,b)

consider the following pseudo cod Algorithm: recursive Max( A, n) if T(n) is the run time of this code, then Input: array A of size n>=1 1 if n=1 Output: maximum element of array A T(n)= If(n==1 ) then T(n-1) + 2 if n>1 return A[O] else time to execute Max(A,n-1) time for 2 return max(Max (A, n-1), A(n-1)) comparisons n=1? and max(a,b) NOTE max(a,b) returns the maximum of a and b Find the run-time of T(n)