consider the following max $-$heap. Answer the following questions based on this heap.

a$)$ How, this heap would be stored in a list? show the contents as well as the indices of array

$\backslash$table$[[$Index$,,,,,],[$content$,,,,,,]]$

b$)$ consider a node i$,$ What is the index of its parent node and child node?

Parent node $=?$

Left child node $=?$

right child node $=?$

c$)$ draw the process of inserting $105$ to orginal heap

d$)$ Remove an item from the original heap, and draw how the heap would change?