Remaining Time: 52 minutes, 07 seconds. Question Completion Status: 3 6 7 8 Consider the following algorithm: ALGORITHM NONAME(A[O..n-1.0.n-11) // Input: A matrix A[o.n.1, 0..n-1] of real numbers for i = 0 to n-2 do for j =i+1 to n-1 do if A[i, j] != Alj, 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 in the worst-case and the best-case? D. What is the efficiency class (in terms of Big-o notation) of this algorithm in the worst-case and the best-case? For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac). BI S Paragraph Arial 14px V E