ALGORITHM Puzzle (A[0..n - 1; 0..n - 1]) //Input: A matrix A[0..n - 1; 0..n - 1] of real numbers I/Output: ??? for i = 0 ton 2 do for ; i + 1 to n - 1 do swap (A[i, j], Alj, i]) return A Answer the following questions: a. What does this algorithm compute? b. What is its basic operation? C. How many times is the basic operation executed? d. What is the efficiency class of this algorithm? e. Suggest an improvement, or a better algorithm altogether, and indicate its efficiency class. If you cannot do it, try to prove that, in fact, it cannot be done