1. Show, step by step, how heapsort will sort a list consisting of numbers 7, 27, 20, and 12. Just shows how the order changes step-by-step, no need to write any code.

2. Show, step by step, how the numbers 7, 27, 20, and 12 will be placed into a balanced binary search tree. Explain how to transform the binary search tree into a sorted list.