1. Draw the tree state of a min-heap after adding these elements. You should draw the tree step by step. (3,2,6,1,5,4)

Draw the tree state of a min-heap after eliminating only one root node (not all of them). You should draw the tree step by step.

2. Create min-heap tree for {7,3,5,2,4,6}

When the root is removed from the above heap tree, how do we alter the tree? Create a new heap tree step by step.