Bounded Depth First Search

For the questions concerning bounded depth$-$first$-$search $($DFS$)$ please answer the

questions using the following graph:

Suppose that we start at the root node of this tree$-$shaped graph, and always to DFS by going to the left child of a node before going to the right child when we have a choice.

Suppose we use ID$-$DFS with an initial depth bound of $0$ and a bound increment of $1.$

Which goal node does ID$-$DFS encounter first?

Question $5$ options:

Q

R

T

U

V

W

Y

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

No spaces

How many nodes are examined during ID$-$DFS to find the goal node that it discovers first?

Question $7$ options:

$11$

$12$

$13$

$14$

$15$

$16$

$17$

$18$

$19$

$20$

$21$

$22$

$23$

$24$

$25$

$26$

$27$

$28$

$29$

$30$

Assume we do branch$-$and$-$bound DFS to find an optimal goal node. How many nodes total are examined by branch$-$and$-$bound DFS$?$ Assume that this does not use iterative deepening.

Question $8$ options:

$10$

$11$

$12$

$13$

$14$

$15$

$16$

$17$

$18$

$19$

$20$