Suppose you had two (full binary tree) max-heaps, what is an efficient way to merge both? Give a concise description or write loose pseudocode and give the running time. If you use another algorithm as a sub-process, you need only explain what you use and not copy pseudocode from that algorithm.