Question $6$

$10$ pts

Suppose the underlying binary tree for a heap has the values, from level $0$ to level $2,$ left to right, of $36,18,20,7,15,6,17$ and then two elements are dequeued. Then the new order of the nodes in the underlying binary tree, from level $0$ to level $2,$ left to right, is:

$36,18,20,7,15$

$18,7,15,6,17$

$18,17,15,6,7$

$18,15,17,7,6$

None of these is correct.