c. Answer the following questions on binomial min-heap. i. Insert the values in set A into an initially empty binomial min-heap A. Show only the final tree. A: 13 62 98 43 16 24 ii. Insert the values in set B into an initially empty binomial min-heap B. Show only the final tree. B: 29 84 67 19 15 44 iii. Finally, merge binomial min-queue A with heap B