Draw the array along with the tree diagram tracing the steps to sort the following list of numbers using heapsort.

$332040365$

both the array and the corresponding tree diagram.

Draw the original diagram;

Copy$/$paste the diagram;

$\}$

while $($some nodes other than the root remain un$-$highlighted$)\{$

Copy$/$paste the diagram;

if $($the array represents a heap$)\{$

Swap array$[0]$ with the last unhighlighted item in the array;

highlight that item.

$\}$ else $\{$

$\}$

$\}$

The solution will have $13$ swaps $($thus$,14$ copies of the diagram$).$

c$++$