Consider the following algorith m: ALGORITHM: Mystery (A[0..n1]) // Input: An array A[0..n1] of n real numbers aA[n1] bA[n1] for in2 downto 0 do if A[i]b then bA[i] return ba 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 efficiency class. If you cannot do it, try to prove that, in fact