How will the following min-heap appear on inserting the key 32?
Original min-heap (level order): 5, 10, 25, 30, 40, 50, 60, 70, 80, 90 (root 5; children of 5 are 10 and 25; children of 10 are 30 and 40; children of 25 are 50 and 60; children of 30 are 70 and 80; the only child of 40 is 90).

1. ANew node 32 inserted as the right child of 40 (sibling of 90), with no further rearrangement – heap order left unfixed
2. BAfter insertion the heap is re-arranged so that 10's children become 32 and 30, and 32's children become 90 and 40 (25's children remain 50 and 60)
3. CNew node 32 inserted as a second child of 50, leaving the rest of the tree unchanged
4. DNew node 32 inserted deep under 30's subtree below the existing leaves, breaking the complete-tree shape

Pick an option to check yourself, or open the answer below.