GATE CSE 2023 Q46: Worst-case Extract-Max and Insert on a max-heap

Let $A$ be a priority queue for maintaining a set of elements. Suppose $A$ is implemented using a max-heap data structure. The operation Extract-Max($A$) extracts and deletes the maximum element from $A$. The operation Insert($A$, key) inserts a new element key in $A$. The properties of a max-heap are preserved at the end of each of these operations.

When $A$ contains $n$ elements, which one of the following statements about the worst case running time of these two operations is TRUE?