Consider the Binary Search Tree $($BST$)$ built by inserting the following sequence of letters, one at a time: e$,$ a$,$ j$,$ i$,$ b$,$ d$,$ c$,$ g$,$ h$,$ f

In a level$-$order traversal of the BST that was created, which node was the last to be enqueued before the node containing j was dequeued?

$($a$)$ The node containing d$.$

$($b$)$ The node containing f$.$

$($c$)$ The node containing h$.$

$($d$)$ The node containing c$.$

$($e$)$ The node containing i$.$

$($f$)$ The node containing a$.$

$($g$)$ The node containing e$.$

$($h$)$ The node containing g$.$

$($i$)$ The node containing j$.$

$($j$)$ The node containing b$.$