3. Heap Sort a) The following 10 numbers are inserted in the same order from left to right into a heap. Draw the resulting heap giving all the intermediate swaps that happen to get to the final heap. 16 8 18 97 14 5 22 5 19 b) Assuming that the heap is stored in a 1-D array list the content of this array starting from position 0 to position 9 c) Draw the resulting heap after deleting the top node and show all the swaps that happen to xeheapdown the heap 3. Heap Sort a) The following 10 numbers are inserted in the same order from left to right into a heap. Draw the resulting heap giving all the intermediate swaps that happen to get to the final heap. 16 8 18 97 14 5 22 5 19 b) Assuming that the heap is stored in a 1-D array list the content of this array starting from position 0 to position 9 c) Draw the resulting heap after deleting the top node and show all the swaps that happen to xeheapdown the heap