$($a$)$ Describe how to build an initial heap from an unordered list of n items $($the

initial heap should be a balanced tree$).$

$($b$)$ Use your method in part $($a$)$ to make a heap for the lists in Exercise $1.$

$($c$)$ Apply heap sort to the heaps in part $($b$).$