i hope, option A is more accurate... why?
we have log n levels in the heap, it is sure...
it is saying that already its left sub-tree and right sub-tree is heapified
therefore remaining is root only, on heapifying the value( initially at the root node), may go atmost the last level (log n level) ------> it is not always happens ===> Θ ( log n ) wrong
and it can not be more than log n ===> Ω( log n) cancelled, the remaining option is A
with in the A also my choice is O( log n ) due to some time it is equal to ( log n ).