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 ton - 1 do if A[i, j] notequalto A [j, i] then return false end end return true What does the algorithm compute? What is its basic operation? How many times is the basic operation executed? What is the efficiency class of this algorithm