Suppose that you have two binary heaps H₁ and H₂, each with exactly 2^k-1 elements. The heaps are represented with explicit binary trees; they are not encoded into arrays. Describe (in precise English, not with code) an O(k) algorithm that will combine H₁ and H₂ into a single binary heap with 2^k+1- 2 elements. Explain why it is O(k)

Now suppose that H₁ and H₂ each have exactly 2^k-2 elements. Describe (in precise English, not with code) an O(k) algorithm that will combine H₁ and H₂ into a single binary heap. Explain why it is O(k)