Which statement about a heap-based priority queue is true?

Which statement about a heap-based priority queue is true?

• A. Insert is O(log n) and extract-min is O(log n).
• B. Both insert and extract-min are O(1).
• C. Only insert is O(log n).
• D. There is no bound on operation time.

Answer: (A)