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? undamentals of the Analysis of Algorithm Efficiency 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. 5. Consider the following algorithm. ALGORITHM Foo (A[0..n1]) //Input: An array A[0..n1] of n real numbers val 100; sumgreater 0; sumless 0 for i0 to n1 do if A[i]>val sumgreater A[i] if A[i]