Show the following regarding the maximum item in a min-heap. It must be a leaf node. There are no more than [N/2] leaves. Every leaf must be examined to find it. Show the result of inserting the sequence of values 10, 21, 1, 14, 6, 5, 8, 15, 3, 9, 7, 4, 11, 13, 2 into an initially empty binomial heap. (Just give the final tree diagram). Show the result of performing three deleteMin() operations on the result of the previous