For the following array: A= 20,>

(a) Create a max heap using the algorithm BUILD-MAX-HEAP.

(b) Remove the largest item from the max heap you created in 3(a), using the HEAP-EXTRACT-MAX function. Show the array after you have removed the largest item.

(c) Using the algorithm HAX-HEAP-INSERT, insert 56 into the heap that resulted from question 3

(b). Show the array after insertion.