Qus $2($a$)$: Make a complete Binary Tree using the following data and convert it to the

Maxheap algorithm discuss in the class $($BuildMaxHeap$($A$,$size$))$:

$\left[\begin{array}{cccccccccc}26& 05& 77& 01& 61& 11& 59& 15& 48& 19\end{array}\right]$

$2($b$)$: Use the Heap Sort algorithm $($HeapSort$($A$,$size$))$ to sort the array.

$(15$ Marks$)(4-5$ Pages$)$