Algorithm$1$: Secret $(A_{0\text{d}\text{o}\text{t}\text{s}\text{n}-1})$

Data: Input: An array $A[0$dotsn$-1]$ of $n$ real numbers

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

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

if $A[i]=A[j]$ 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?

e$)$ Suggest an improvement or a better algorithm altogether and indicate its efficiency class. If you

cannot do it$,$ try to prove that, in fact, it cannot be done.Algorithm$1$: Secret $($A$[0...$n$-1])$

Data: Input: An array A $[0...$n$-1]$ of n real numbers

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

for j $$ i$+1$ to n$-1$ do

if A$[$i$]=$ A$[$j$]$ 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?

e$)$ Suggest an improvement or a better algorithm altogether and indicate its efficiency class. If you cannot do it$,$ try to prove that, in fact, it cannot be done.