You are given an array A[1..n] of n distinct integers. We say that a pair of indices (i, j) forms a large reversal if

i < j with i, j {1, 2, ..., n}; and

A[i] > 3A[j].

Your goal is to design a divide and conquer algorithm that counts the number of large reversals in A in O(n log n) time.

(a) Describe your algorithm in pseudocode.