A Priority – Queue initially has $5$ elements and is implemented as a Max Heap. The level – order traversal of the heap is: $11, 9, 6, 4, 3.$ Two new elements $2$ and $8$ are inserted in the heap in that order. The level – order traversal of the heap after the insertion of the elements is:
- $11, 9, 8, 4, 3, 2, 6$
- $11, 9, 8, 6, 4, 3, 2$
- $11, 9, 8, 3, 4, 2, 6$
- $11, 9, 8, 2, 3, 4, 6$