Suppose two binary trees, T 1 and T 2 , hold entries satisfying the heap-order property.

Suppose two binary trees, T 1 and T 2 , hold entries satisfying the heap-orderproperty. Describe a method for combining T 1 and T 2 into a tree T whose internal nodeshold the union of the entries in T 1 and T 2 and also satisfy the heap-order property. Youralgorithm should run in time O(h 1 + h 2 ) where h 1 and h 2 are the respective heights of T 1and T 2 .