Consider the following binary heap $H.$

Let $H_1$ be the result of applying an Extract$-$Max operation on $H$ and let $H_2$ be the result of applying an Insert

operation with key $29$ on $H.$ Construct the arrays representations of $H,H_1,$ and $H_2$ and state the content of each

of the following entries $($recall that a heap with $n$ items in the array representation consists of an array of length

$n+1$ where index $0$ is not used$).$ Consider the following binary heap: Whats H$[1],$ H$[2],$ H$[3]$ and H$[5].$ and H$\_1[1],$ H$\_1[2],$ H$\_1[3]$ and H$\_1[5].$ and H$\_2[1],$ H$\_2[2],$H$\_2[3]$ and H$\_2[5]$