1. Merge the following Leftist Heaps into a single Leftist Heap 75 10 15 20 25 50) 99 2. Merge the following Leftist Heaps into a single Leftist Heap 3. Describe the most time-efficient way to implement the operations listed below Assume no duplicate values and that you can implement the operation as a member function of the class - with access to the underlying data structure. Then, give the tightest possible upper bound for the worst case running time for each operation in terms of N. Merging two binary min-heaps (both implemented using an array) each containing N elements into a single binary min heap. Explanation: 4. Suppose there is a binary min-heap with exactly 4 nodes, containing items with priorities 3, 9, 11, and 15 a) Show every possible binary min-heap that could match this description. For each, draw the appropriate tree and the array representation. (You can show just the priorities, not the corresponding items.) b) For one of your answers to part (a), show what happens with 4 deleteMin operations Clearly indicate which heap you are starting with and show the heap after each deleteMig. You can just draw the tree (not the array) after each step