Repeat the previous problem for red-black trees T and U.

Data from in Previous Problem

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 in U. Describe an O(log n+logm) time method for joining T and U into a single tree that stores all the entries in T and U.