An inversion in a sequence is an out-of-order pair; i.e., i aj. Inversions are discussed briefly in the book on page 252. For example, the sequence (5,3,2,1,4) has 7 inversions. Explain carefully how to use red-black trees to compute the number of inversions in a permutation in time 3. O(n log n). Effectively, you may need to modify the code for Algorithm 3.4 on page 439. Explain in detail any changes that you would make to method put(). ALGORITHM 3.4 Insert for red-black BSTs public class RedBlackBST0) h.right put(h.right, key, val); else h.val - val;: if if if (isRed (h.right) (isRed (h.left) CisRed (h.left) && isRed(h.right)) && && !isRed (h . eft)) sRed (h.left. 1 eft)) h = h flipColors (h); rotateLeft (h); rotateRight(h); h.N size(h.left) size(h.right) 1; return h