11 10 Points Show Initially Empty Min Heap Would Look Like Inserting 10 12 1 14 6 5 8 15 3 Q37102283

Please show all steps. Thanks.

1.1 (10 points) Show how an initially empty min-heap would look like after inserting 10, 12, 1, 14, 6, 5 8, 15, 3, 9, 7,4, 11, 13 and 2 one at a time 1.2 (10 points) Show the result of using the linear-time algorithm to build a min-heap using the same input Show transcribed image text 1.1 (10 points) Show how an initially empty min-heap would look

OR

 

OR