2. Let A is an array of n elements. What does the following function do? Find its time complexity. (solve the obtained recursive equation) Mystery (A,n) \{ if (n==1) return; m=0; for (i=1 to n1) if(A[i]>A[m])m=i; A[n]=A[m]; A[m]=t; Mystery (A,n1); \}