Question $37$

Concatenate all the following digits, $1093859,$ with $9$ in front of it and $1$ at the end and form a list.

Example: $1093859,$ after concatenation $910938591,$ the list: $9,1,0,9,3,8,5,9,1.$

Sort this list using Heap Sort. To avoid confusion ignore the duplicates $($do not insert them$).$

a$)$ create a Max Heap displaying step by step $($redraw it after every element is inserted one

by one left to right$)$ from your list.

b$)$ represent your Max Heap as an array

c$)$ remove elements step by step $($re$-$draw the Heap after every element is deleted$)$ storing

elements in another array right to left $($first one goes in the last rightmost cell$)$