Consider the following set of $10$ items:

$73,42,58,91,27,64,35,80,56,19$

Perform the sorting of these items using the Heap Sort technique. Show the stepby$-$step process of building the max heap, extracting the maximum element, and the final sorted array.

$(10$ marks$)$