Let be a priority queue for maintaining a set of elements. Suppose is implemented using a max-heap data structure. The operation Extract-Max() extracts and deletes the maximum element from . The operation Insert(, key) inserts a new element key in . The properties of a max-heap are preserved at the end of each of these operations. When contains elements, which one of the following statements about the worst case running time of these two operations is TRUE?
- ABoth Extract-Max() and Insert(, key) run in .
- BBoth Extract-Max() and Insert(, key) run in .
- CExtract-Max() runs in whereas Insert(, key) runs in .
- DExtract-Max() runs in whereas Insert(, key) runs in .

