Given the following set of data: 17, 12, 1, 4, 6, 9, 7, 2

Provide a heap that stores the data as a tree. Show how the heap sort algorithm works by providing the heap content/structure with each new number considered.

Display the contents with a heap diagram tree.