The following array is already a Heap. Illustrate how HeapSort works on this Heap. You only have to show the first iteration of HeapSort - i.e., which element the root will be swapped with and the...

Extracted text: The following array is already a Heap. Illustrate how HeapSort works on this Heap. You only have to show the first iteration of HeapSort - i.e., which element the root will be swapped with and the subsequent full FixHeap that follows. You must clearly show the node and its children considered in each step. A[1,...,n] = [ 23, 17, 14, 6, 13, 10, 1, 5, 4, 12 ]