Consider the following algorithm.

Algorithm Enigma $(A[0..n-1,0..n-1])$

$//$Input: $$ matrix $[0..n-1,0..n-1]$ of real numbers

for ilarr$0$ to $n-2$ do

for jlarri$+1$ to $n-1$ do

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 class of this algorithm?