Q$3$: Priorito Queue $(15$p$)$

A max heap priority queue is given below

a$)$ Draw the structure of the binary heap after adding a new node with a value of $27.$

Draw the structure of the binary heap after performing a deleteMax operation to the binary heap obtained in part $($a$).$ Which element is returned as a result?

corresponding binary heap $($which is obtained in part b$)$ is implemented on an what would be the final state of the array?