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

Example: $1293459,$ after concatenation $912934591,$ the list: $9,1,2,9,3,4,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$)$