$(12$ points$)$ Max Binary Heap

a$)$ Show the results of using the linear$-$time algorithm to build a max binary$-$heap using the input: $4,5,$

$25,12,19,9,10,15,14,6.$

b$)$ Show the result of deleteMax to the following max binary heap.

$40,29,25,10,15,9,5,8,4,3,7$

c$)$ Show the result of adding $27$ to the following max binary heap.

$40,29,25,10,15,9,5,8,4,3,7$