Part 3: Red-Blak and 2-4

Exercise 6. Let T and U be (2,4) trees storing n and m entries, respectively, such that all the entries in T have keys less than the keys of all the entries inU. Describe an O(logn+logm)-time method for joining T and U into a single tree that stores all the entries in T and U. ( Hint: Find the right place to splice one tree into the other to maintain the (2,4) tree property)