I need help on this lab Im working on .

Build Heap 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 Convert the subtree with root of listlindex] into a heap. a. Given list[a] is root of tree, list[b] is left child (root *2 +1), list[cj is right child (root 2+2), if exists b. Compare list[b] with list[c] to determine larger child, c. Compare list[a] with list[largerlndex]. If list[a]