Java

Consider the following algorithm: public boolean enigma (int [l input) f int j = input [0]; int k = input [0]; for (int i !; i k) k input [i] ; return (k-j); (a) 5 points. What does this algorithm compute? (b) 5 points. What is the basic operation of this algorithm? (c) 10 points. How many times does this algorithm perform its basic operation, in the worst case? (Give an exact answer.)