Concatenate operation takes two sets, such that all the keys in one set are smaller in comparison to all the keys in other set, and merges them together. Assume that T1 and T2 are binary search trees in which all the keys in T1 are smaller in comparison all the keys in T2. Develop an algorithm that concatenates T1 and T2 into the single binary search tree. The worst case running time must be O(h), where h is the maximum of h1 and h2, the heights of T1 and T2.