Consider the following 3 algorithms and answer the (a) to (d) questions for each algorithm. (15 points) 9) ALGORITHM Mystery(n) I/Input: A nonnegative integer n for i 1 to n do return S ALGORITHM Secret(0..n-1]) I/Input: An array A[0.. min val A[0]; maxval A[0] for1 to 1] of n real numbers 1 do if Alil maxval maxval A[i] return maxval - minval ALGORITHM Enigma(A[0.. 1, 0.n 1]) //Input: A matrix A[0. for iOto n _ 2 do 10.. 1 of real numbers .1n for ji1 to -1 do if i, j]A[j, i] 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