PLS HELP ANS MAKe sure each step is shwon im really lost on where ri start ans i have asked this quetsion $3$ time by teh experts but no of the answers are explain and howing it correctlyProblem $1$:

$($a$)(12$ pts$)$ The values $16,25,32,19,106,59,12,3,99,42,6,27$ are to be inserted into a MAXheap $($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:

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

Problem $2$:

$(8$ pts$)$ Show the details of $3$ deleteMax$()$ operations applied to the final MAX$-$heap from Problem $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:

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

Problem $3$: $(5$ pts$)$ MIN$-$heapify the final MAX$-$heap from Problem $2($depicted$).$ Draw the binary heap after each swap of nodes. Also list the contents of the Vector that represents your final MIN$-$heap.