Consider the classic problem, counting inversions. Given an…

Consider the classic problem, counting inversions. Given an integer array A of size n, find the inversion count in the array. Two array elements A[i] and A[j] form an inversion if A[i] > A[j] and i < j. A sorted ascending array has 0 inversions. A sorted descending array has n(n-1)/2 inversions. Skipping the correctness and analysis sections, a solution that would be considered correct and efficient for this class would be:

B. Non, merci.  Now tell what these people are not doing. (4…

B. Non, merci.  Now tell what these people are not doing. (4 x 2 pts. each = 8 pts.)   Important: Please note that you are being asked to do two things, the first is to negate the verb and the second to conjugate the verb. Please, do not rewrite the whole sentence. Please only fill in the component that is required in the blank.