Below is a list of integers. Please determine, without transforming
the list into an actual tree, whether it represents a HEAP.
While keeping the list in list form, implement the heapsort procedure
on it and show the intermediary partially ordered lists generated by
the algorithm until a fully ordered list is achieved.