9. Consider the following algorithm and answer the questions. (10%) ALGORITHM T (A[0..n1]) // Input: A contains n1 real numbers for i1 to n1 do vA[i] ji1 while j0 and A[j]>v do A[j+1]A[j] jj1 A[j+1]v 1. What does this algorithm compute? 2. What is the input size? 3. What is the basic operation? 2 4. How many times is the basic operation executed? (Set up a sum, and simplify the sum, to find the function expressing the number of repetitions of the basic operation.) 5. What is the efficiency class of this algorithm