5 points You are given a complete binary tree T with n = 2d leaves, where each leaf contains Reading the leaf values fro question is how small we can make the number of inversions in that sequence by applying the 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 onoe inversion. It is impossible to do better, so the answer for this particular example is 1 Design an O(nlogn) algorithm for this problem. 5 points You are given a complete binary tree T with n = 2d leaves, where each leaf contains Reading the leaf values fro question is how small we can make the number of inversions in that sequence by applying the 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 onoe inversion. It is impossible to do better, so the answer for this particular example is 1 Design an O(nlogn) algorithm for this