The HeapSort algorithm has been executed until line 2. In the figure, you can see the input array (both as an array and a binary tree representations). Continue the execution from line 2.

You can swap keys by drag and dropping them on each other in either of the representations (array or binary tree). Begin by swapping the last key with the largest key, and perform all the required operations necessary with the DeleteMax routine in order to heapify the array again.

HeapSort(array heap, int heapsize)
1. BuildHeap(heap, heapsize)
2. while heapsize > 1 do
3.   heap[heapsize-1] = 
        DeleteMax(heap, heapsize) 
4.   heapsize = heapsize - 1