Please answer the following question. The sooner the better

Algorithm 2 Mystery (A(0...n 1,0.. 1]) //Input: A matrix A[0.. .n 1,0...n 1 of real numbers for i 0 to n 2 do for ji+ to -1 do return triueturn false a) b) c) d) e) What does this algorithm compute? What is its basic operation? How many times is the basic operation executed? What is the efficiency class of this algorithm? Are the best, average, and worst case time efficiencies the same or different? Justify your