I know this might be a bit time consuming, but you take the time to clearly draw each step out? I$$m sorry about the bother, but written instructions like that confuse me$.$ Having things clearly laid out makes it much easier to follow. Others on Chegg have done this problem, but don't have everything clearly laid out.

Part $1$:

$($a$)$ The values $16,25,32,19,106,59,12,3,99,42,6,27$ are to be inserted into a MAX$-$

heap $($initially empty$).$ Insert the values in the listed order.

Demonstrate the process by drawing the Binary Heap $($tree$)$ after each insertion and verify that

the final binary heap will be like this $($has $106$ on top$)$

$($b$)$ List the contents of the Vector that represents the final MAX$-$heap in $($a$).$

Part $2$:

Show the details of $3$ deleteMax$()$ operations applied to the final MAX$-$heap from

Part $1($depicted$).$ Draw binary heap after each swap of nodes and$/$or node deletion. Verify that the binary heap after $3$ applications of deleteMax$()$ looks like this $($in image that has $42$ on top$)$

$($b$)$ List the contents of the Vector that represents the final MAX$-$heap in $($a$).$

Part $3$:

MIN$-$heapify the final MAX$-$heap from Part $2($depicted$).$ Draw the binary

heap after each swap of nodes. Also list the contents of the Vector that represents your final

MIN$-$heap.