Please answer both questions, as they are related :)

a) Explain or give pseudocode for the use of a max heap to sort the elements of a list into descending order. Give the worst-case complexity for heap sort. b) Demonstrate the algorithm to sort the list 10,15,3,8,9. State the method used for heap construction and draw the state of the heap (as a tree) after each insertion and deletion.