if it is possible, please send the text solution instead of handwriting. if handwriting, please make it clear as possible as you can.

Problem 2 (3 points). We consider the following problem of counting stronger inversions. Given an array A of n positive integers, a pair i, j E 11, 2 n of indices is called a strong inversion if i j and Ali] 2Ali]. The goal of the problem is to count the number of strong inversions for a given array A. Give a divide-and-conquer algorithm that runs in O(n lg n) time to solve the