Need help with simulating Heap Sort on paper by filling in the following array and showing the items in a tree.

Build Heap 1. Let index = length/2-1. This is the parent of the last node in the tree, i.e. list[index + 1]. . . list[length-1] are leaves 2. Convert the subtree with root of list[index] into a heap. a. Given list[a] is root of tree, list[b] is left child (root *2 b. Compare list[b] with list[c] to determine larger child, c. Compare list[a] with list[largerlndex]. If list[a]