5. 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 0 to n _ 2 do for j i + 1 to n-Ido if A[ i, j] A[j, i] return false return true 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 of this algorithm? e. Either improve the algorithm or explain why that is impossible