5) Consider the following algorithm. ALGORITHM MysteryLaw( C, q[1...n] ) //Input: //Output: 1 for i+1 to n do F[i] – 0 for j+1 to n do if ji then C qli] qli] (i – j)? F[i] + F[i] + 6 F[i] + F[i] – 7 8 print F[i] 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? 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 algorithm given below.    ALGORITHM MinDistance(A[0..n − 1])    //Input: Array A[0..n − 1] of numbers    //Output: Minimum distance between two of its elements        dmin←∞         for i ←0 to n − 1 do                for j ←0 to n − 1 do                         if i != j and |A[i]− A[j ]| < dmin                                  dmin ←|A[i]− A[j ]|      return dminif  n = 20, and the list is sorted in descending order, then the loop  " or i ←0 to n − 1 do " will be executed ______ times.

1 Write a Racket function (is-sorted x) where x is a list of numbers. Function returns true (#t) if numbers are in ascending order, false (#f) if not. Examples > (is-sorted (1 2 34 5)) #t > (is-sorted (2 1 2 3 4)) #f Algorithm If x is one element return #t Else Evaluate 1" element of x < 2n° element of x Evaluate function recursively with argument (cdr x) Value is the AND of the two expressions