For the given nodes:
$89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100$
minimum ______ number of interchanges are required to convert it into a max-heap.
Heap formed by the given values in question is
Now the max heap property is failing on vertices $15$ and $100$
After swapping tree is
Now the max heap property is failing on vertices $50$ and $100$
Now the max heap property is failing on vertices $89$ and $100$
The above tree is the final max heap binary tree.
Minimum number of interchanges are $3$
Correct answer: $A$