ans is (D)....whenever we insert an element in heap,it will always inserted in last level from left to right..so here we insert element $1$ and $7$ as a child of node $5$.then we perform heapify algorithm until we get the min/max heap..so here finally in above question we get the heap whose level order traversal is $10,8,7,3,2,1,5$
Initial heap:
After insert of $1$
After insert of $7$