[5 points] You are given a complete binary tree T with n2d leaves, where each leaf contains integer value. Reading the leaf values from left to right yields a sequence of integers. The question is how small we can make the number of inversions in that sequence by applying the an following type of operation: Select an internal vertex and swap the two child subtrees. For example, if the sequence of leaf values is (4,2, 1, 3), then a swap at the root followed by a swap at the right child of the root turns the sequence into (1,3,2,4), which has only one inversion. It is impossible to do better, so the answer for this particular example is 1 Design an O(n log n) algorithm for this problem. [5 points] You are given a complete binary tree T with n2d leaves, where each leaf contains integer value. Reading the leaf values from left to right yields a sequence of integers. The question is how small we can make the number of inversions in that sequence by applying the an following type of operation: Select an internal vertex and swap the two child subtrees. For example, if the sequence of leaf values is (4,2, 1, 3), then a swap at the root followed by a swap at the right child of the root turns the sequence into (1,3,2,4), which has only one inversion. It is impossible to do better, so the answer for this particular example is 1 Design an O(n log n) algorithm for this