1-Show what the array would look like at each step when the heapIncreaseKey operation
(increase the key value of the 8th node from 2 to 20) is performed on the max-heap array shown
below:
heap = {16, 14, 10, 8, 7, 9, 3, 2, 4, 1}

2-Show what the array would look like at each step when the maxHeapInsert operation to

insert a new key with value 12 is performed on the max-heap array shown below:
heap = {16, 14, 10, 8, 7, 9, 3, 2, 4, 1, 5}
Note: For problems 4 and 5 above, the heapIncreaseKey and the maxHeapInsert operations were
discussed in the Priority Queue section of the lecture. Only show what the arrays look like after
each step of rearranging the nodes. No need to write a program or draw the binary trees.
Note: The answers for problems 4 and 5 would look something like this:
Step 0: heap = {16, 14, 10, 8, 7, 9, 3, 2, 4, 1}
Step 1: heap = {[the sequence of numbers after step 1]}
Step 2: heap = {[the sequence of numbers after step 2]}
. . .
Finally: heap = {[the sequence of numbers after completion]}