Heap Sort

1. Which of the following sets of numbers forms a balanced heap after the insert heap step is performed?

a: 1, 4, 3, 9, 2, 8, 6, 7 b: 2, 3, 9, 1, 6, 7, 4 c: Both d: Insufficient information

2. What do you think is the complexity of inserting into a heap using this naive insert heap method? (Consider if it can be further improved)

a: n b: log n c: n log n d: n^2