Which goal nodes are found in doing a branch$-$and$-$bound DFS to find an optimal solution?$$ Assume that when searching, when you encounter a node with two children you always examine the left child of a node before its right child.$$ List all the nodes discovered, in the order in which they are discovered.$$ So$,$ for instance, if you think that branch$-$and$-$bound DFS finds goal nodes R$,$ Y$,$ and U in that order but does not discover goal nodes Q$,$ T$,$ W$,$ or V$,$ you would write

RYU