Answer TRUE or FALSE.
Heapsort (as the code is written in this module) is a stable sorting algorithm. Recall that a stable sorting algorithm maintains the relative order of records with equal keys.
What happens when two equal values are in separate branches of the tree?
Can the one appearing later in the array move up in the tree?