Sorry i also misunderstood
previously i followed the steps given in geeks for geeks
In Heapsort, we first build a heap, then we do following operations till the heap size becomes 1.
a) Swap the root with last element
b) Call heapify for root
c) reduce the heap size by 1.
In this question, it is given that heapify has been called few times and we see that last three elements in given array are the 3 maximum elements in array. So situation is clear, it is maxheapify which has been called 3 times.
but right now i am also confused.