Given the following complete binary treet $$

$($a$)$ Write this tree as an array, based on the representation wo saw in class:

original array:

$\backslash$table$[[,,,,,,]]$

$($b$)$ Heapify the elements of the array into a max$-$heap. Show the final array after the entire process: heapified array:

$\backslash$table$[[,,,,,,],[,,,,,,]]$

$($c$)$ Remove the largest element from your max$-$heap in part $($b$).$ Show the final array after removal and restoration of the heap property:

final array:

$\backslash$table$[[,,,,,]]$

From the array in part $($c$),$ remove the largest element again. Show the final array after removal and estoration of the heap property:

final array: $$