h.heapInsert (61); h.heapInsert h.heapDelete (item); // binary heaps i. h.heapInsert (4); (27) ; h.heapInsert (23); h.heapInsert (34); // binary heaps ii. h.heapDelete (item) ; h.heapInsert (16);...

1. What does the initially empty max-heap
   h
   contain after the following sequence of pseudo-code operations? Show at least 5 binary heaps as stated in Figure 1 to show the changes after a sequence of heap operations.

Extracted text: h.heapInsert (61); h.heapInsert h.heapDelete (item); // binary heaps i. h.heapInsert (4); (27) ; h.heapInsert (23); h.heapInsert (34); // binary heaps ii. h.heapDelete (item) ; h.heapInsert (16); h.heapInsert (19); // binary heaps iii. h.heapInsert (5); h.heapInsert (7); h. heapDelete (item) ; // binary heaps vi. h.heapInsert (24); h.heapInsert (29); h. heapInsert (15) ; // binary heaps v. Figure Q2.1 : Pseudo code operations