For the question 6.3, show your solution step by step. Draw all intermediate trees.

Here is the previous question that 6.3 is referencing:

6.3 Show the result of performing three deleteMin operations in the heap of the previous exercise. 6.2 a. Show the result of inserting 10, 12, 1, 14, 6, 5, 8, 15, 3, 9, 7, 4, 11, 13, and 2, one at a time, into an initially empty binary heap. b. Show the result of using the linear-time algorithm to build a binary heap using the same input