^Heap Sort
~Given the following numbers in array A ...

56 61 74 68 43 38 30 49 50 33

... using the Heap Sort, what is the contents of array A after the
heap has been built?  Use the definition 'smallest at the top'.

a.   30 33 38 50 49 74 43 68 56 61
b.   33 61 49 43 74 68 56 30 38 50
c.   49 50 43 61 38 33 30 56 74 68
d.   30 43 38 61 68 33 50 74 56 49
e.   38 74 30 56 49 61 68 50 43 33