Consider the following divide-and-conquer approach for counting the number of inversions in x: partition x into xl = {x1, . . , xn/2} and xr = {xn/2+ }. all we need to do is to add nl (total number inversions in xl), nr (total number inversions in xr), and the number of inversions occur between xl and xr. complete the design and analysis this algorithm.