1. Merge the following Leftist Heaps into a single Leftist Heap 75 10 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