Here we need to call Heapify/ Bubble down/ Percolate down procedure on Root, which in the worst case will take time $O (\log n).$ So $B$ is the correct option.
Other options do not even make sense, because with $O(n)$ we can even build an entire Heap not just heapify on the root. $O (n \log n) \;\&\; O (n \log \log n)$ is more than $O(n)$.