6 (25 points) Consider the following algorithm Algorithm 2 Mystery(A0...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 _ I do if Ali, j|ALi.ij then return false (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) Are the best, average, and worst case time efficiencies the same or different? Justify your