Heap Sort

1. What is the time complexity of the operation to remove the root from a heap?

a: O(1) b: O(n) c: O(log n) d: Insufficient information

2. How many operations are required to remove the root if there are 10 elements in a heap?

a: 1 b: 5 c: 10 d: 20