A priority queue is implemented as a Max-heap. Initially it has 5 elements. The level order traversal of the heap is 10, 8, 5, 3, 2. Two new elements ‘1’ and ‘7’ are inserted into the heap in that order. The level order traversal of the heap after the insertion of the elements is

A

10, 8, 7, 5, 3, 2, 1

B

10, 8, 7, 2, 3, 1, 5

C

10, 8, 7, 1, 2, 3, 5

D

10, 8, 7, 3, 2, 1, 5