Question 6: Consider the following sequence 8 of numbers: 72.4.9.8. We say that a pair of numbers (1,!) in S is out-of-order if u > b but (1 appears before I) in the sequence. In our example. 7, 2 is out of order, 7, 4 is out-oforder and 9. 8 is out of order. (a) In the worst :ase. how many pairs of numbers can be out-oforder in a sequence .8 of length n. Justify your answer. (11) Design a recursive algorithm to count the number of pairs of numbers that are outof order. Give a justication Why your algorithm correctly counts the number of pairs that are out of order? Hint: You can modify Mergesort to do this