Please do all the questions, no coding, just explanation. Thank u so much!

5. Heap Merge (20 pts;5+5+3+7) Suppose that we have k heaps, with n elements in each. We wish to combine these into a single heap. Each of the following sub-parts describes one approach to merging the heaps, and you are asked to derive the bi;g O running time. To get any credit, you must show your work. a) We create a new, empty heap H. For each of the k heaps, we repeatedly remove the highest priority element and insert it into H, until the original heap is empty. What is the worst-case big O running time