a) Show (diagrammatically) all the steps involved in the heap sort on the following input sequence: 7, 45, 1, 21, 2, 64, 4, 18, 9, 6. You should sort the sequence in the increasing order.

b) Repeat part a) if the heap sort is performed in place.