Illustrate the execution of the heap-sort algorithm on the following sequence: (2, 5, 16, 4, 10, 23, 39, 18, 26, 15). Show the contents of the heap and the sequence at each step of the algorithm. Indicate upheap or downheap bubbling where appropriate.