we motivated the problem of counting inversions as a good measure of how different two orderings are. however, this measure is very sensitive. let’s call a pair a significant inversion if i < j and ai > 2aj . give an o(n log n) algorithm to count the number of significant inversions between two orderings.