Consider the following algorithm. Algorithm Enigma(A(0..n - 1, 0., n - 1]) //Input: A matrix A[0., n - 1, 0, n - 1] of real numbers for i leftarrow 0 to n - 1 do for j leftarrow 0 to n - 1 do lfA[i, j] notequalto A[j, i] return false return true a. What does that algorithm compute? b. What is its basic operation and how many times is the basic operation executed? c. What is the efficiency class (theta(g(n)) the function belongs to) of this algorithm? d. Make as many improvements as you can in this algorithmic solution to the problem. You must write down the pseudocode for your new algorithm. What is the efficiency class of your new algorithm? If you cannot improve this algorithm, explain why you cannot do it