Consider the following algorithm: ср ALGORITHM Secret(A[0..n â^' 1]) //Input: An array A[0..n â^' 1] of n real numbers minval <- A[0] maxval <- A[0] for i <- 1 to n - 1 do if A[i]< minval minval <- A[i]

Answer question number 5 please

Determine the big-O notation of the following algorithm: // A is an array with index from 0 to N-1Algorithm C(A, x, a, b);            if (b<a)              return a           m = (b + a)/2           if (A[m] x)               return C(A, x, a, m-1)           else               return C(A, x, m+ 1,b)   Please answer max in 15-20 minutes thank u

The algorithm below searches for the maximum in an input array A. Assume A is a random sequence containing n distinguishable real numbers, what is the probability for line #4 to be executed exactly once? (The phrase "random sequence" here means the n numbers can appear in any order with equal chance.) mymax(A, n) { 1: max = A[1]; 2: for i = 2:n 3: if A[i] > max 4: max = A[i); 5: end; 6: end; 7: return max; }