Can anyone explain me this question?

Thanks!

A Priority-Queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal is given below. What is the level order traversal of the heap after inserting 1 and 7 10, 8, 5, 3, 2 A. B. C. D. 10, 8, 7, 5, 3, 2, 1 10, 8, 7, 2, 3, 1,5 10, 8, 7, 1, 2, 3, 5 10, 8,7, 3, 2, 1,5