3. What does the following recursive functica do? Desenbe the exfiput Conpute the time complexity of myfunction. (A[0.n-1] is an array of integes) (25 points) myfunction (A,n) f if (n=1) return; myfunction (A,n1); 1=n2; temp =A[n1]; while (12088A[1] > temp ) \{ {[1+1]=A[1]; 1=11; \} {A[1+1]=temp