3. Consider the heaps H1 and H2 given below: H1 H2 Show that they are both leftist heaps by calculating and comparing the null path lengths of each node in each heap, and then merge H and H2. 4. Merge these two binomial queues: (51) 3. Consider the heaps H1 and H2 given below: H1 H2 Show that they are both leftist heaps by calculating and comparing the null path lengths of each node in each heap, and then merge H and H2. 4. Merge these two binomial queues: (51)