a.) Construct a max heap for the list 9, 5, 6, 10, 4, 8, and 3. You should assume that the numbers are given in that order and use the bottom-up approach covered in the class. For the problem, you dont need to describe the intermediate results.

b.) For the result of question (a), delete the maximum value and draw the updated heap.

c.) For the result of the question (b), insert a node with the value 7 and draw the updated heap.