Problem 3 Binomial Heap Operations [3484848 = 27 marks] In this problem, we review binomial heap operations for heaps of the figure below. In case of merging trees in the following operations, in case there were three binomial trees of the same order, merge the two 'older trees (keep the new tree which is the product of previous merge) a) Consider the heap H Indicate which nodes are probed in get-Max operation on Hi b) Apply the operation merge on heaps H and H2. Show intermediate steps. c) Apply operation ertract-maz on heap H3. Show intermediate steps. d) Apply operation insert on heap H4. Assume you insert value 30 to the heap Show intermediate steps 23 10 68 15 13 40 30 25 20 20 1s 19 15 H4 Figure 2: Heaps of Problem 2 Problem 3 Binomial Heap Operations [3484848 = 27 marks] In this problem, we review binomial heap operations for heaps of the figure below. In case of merging trees in the following operations, in case there were three binomial trees of the same order, merge the two 'older trees (keep the new tree which is the product of previous merge) a) Consider the heap H Indicate which nodes are probed in get-Max operation on Hi b) Apply the operation merge on heaps H and H2. Show intermediate steps. c) Apply operation ertract-maz on heap H3. Show intermediate steps. d) Apply operation insert on heap H4. Assume you insert value 30 to the heap Show intermediate steps 23 10 68 15 13 40 30 25 20 20 1s 19 15 H4 Figure 2: Heaps of Problem 2