Consider the following algorithm:

ALGORITHM Secret$(A[0,n-1])$

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

minval larrA$[0]$; maxval larrA$[0]$

for ilarr$1ton-1do$

$ifA[i]$ minval

minval larrA$[i]$

$ifA[i]>$maxval

maxval larrA$[i]$

refurn maxval $-$ minval

a$)$ What does this algorithm compute?

b$)$ What is its basic operation?

c$)$ How many times is the basic operation executed? $($use a summation$)$

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.