Consider the following algorithm.

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

$//$Input: A matrix A$[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 is the input size? choose your answer...

b$.$ What is its basic operation? choose your answer...

c$.$ How many times is the basic operation executed? choose your answer...

d$.$ What is the efficiency class of this algorithm?