Show the max-heap that results from building the heap directly on the following integer values in an array: 10, 5, 12, 3, 2, 1, 8, 7, 9, 4.

And then show how heapsort works in-place using the max-heap built in the previous question to sort the values in ascending order.