$9.$ A binary tree can be implemented using an array with the array index properties. You are given an

array$-$implemented tree as follows.

Element $10685261$

Index $0123456789$

$($a$)$ Is this tree a max$-$heap? If not, make the necessary changes to make it a max$-$heap.

$($b$)$ In the heap, insert a new integer $26$ and draw the reconstructed array.

$($c$)$ From the most updated heap, delete an element $10,$ if exists, and draw the reconstructed array