Question 2 [20 marks) a. [10 marks] Consider the following algorithm Algorithm Secret(A[O..n - 11) //Input: An array A[O..n - 1] of n real numbers minval + A[0]; maxval A[0] for it I to n-1 do if A[i] maxval maxval A[i] return marval - minval Compute the time complexity (i.e., time efficiency) of the above algorithm. b. [10 marks] Consider the following algorithm Algorithm Enigma(A0.n-1, 0..n-11) //Input: A matrix A[0..n-1, 0.-1] of real numbers for i 0 ton-2 do for j i + 1 to n - I do if A[i,j] + A[j,i] return false return true Compute the worst-case time complexity (i.e., time efficiency) of the above algorithm