[3] you need to find a o(nlogn) solution for computing the number of inversions in an array. an inversion of an array is a pair of elements that are "out of order", meaning that the element that occurs earlier in the array is bigger than the one that occurs later.