Union of 2 2-3 trees?

Question

I have two 2-3 tree T1 (with n1 keys) and T2 (with n2 keys)

Knowing each key in T1 is less than every key in T2 how can I return a 2-3 tree which holds the union of t