Heapsort

Max Heap

You are given the array with $7$ elements: $\backslash (3,5,1,2,6,7,4\backslash ).$

Use heapsort algorithm to arrange the elements of this array in increasing order. For this question do construct max heap.

At the end of each iteration of the algorithm, and when the last element is pushed out of the tree into a sorted list $($after "pruning" the tree$),$ enter the state of the $($remaining$)$ tree as a list. Do not separate elements of the list, enter it as a sequence of numbers: e$.$g$.$ if the current remaining tree is $[6,3,2,5,4],$ enter $63254.$

state of the tree after $1$st iteration:

state of the tree after $2$nd iteration:

state of the tree after $3$rd iteration:

state of the tree after $4$th iteration:

state of the tree after $5$th iteration:

state of the tree after $6$th iteration:

Note: To construct sorted list in the ascending order, after the end of each iteration, the "pruned" element is added to the front of the sorted list $($i$.$e$.$ from the left$),$ which will ensure the sorted list is in increasing order. This is not required to be entered in this question's solution, but you can use it to construct the sorted list from your given input list to confirm your result.