Figure $1$: On the graph above, each is a node labeled with a letter and a heuristic distance to the goal $($G$).$ Each link is labeled with its length, i$.$e$.,$ the distance between nodes. The start node $($S$)$ and goal node $($G$).$ Ties break alphabetically.

$($f$)$ Which path returned by Depth$-$First Search $($DFS$)$ strategy, on Figure $(1),$ to go from start state $S$ to goal state $G$ :

$S-A-B-D-G$

$S-C-D-G$

$S-A-B-G$

$($g$)$ Which path returned by Breadth$-$First Search $($BFS$)$ strategy, on Figure $(1),$ to $30$ from start state $S$ to goal state $G$ :

$S-A-B-D-G$

$S-C-D-G$

None of the above

$($h$)$ Which path returned by Uniform$-$Cost Search $($UCS$)$ strategy, on Figure $(1),$ to go from start state $S$ to goal state $G$ :

$S-A-B-D-G$

$S-C-D-G$

None of the above

$($i$)$ Which path returned by Greedy Search strategy, on Figure $(1),$ to go from start state $S$ to goal state $G$ :

$S-A-B-D-G$

$S-C-D-G$

None of the above

t$)$

$($j$)$ Which path returned by $A^{**}$ Search strategy, on Figure $(1),$ to go from start state S to goal state $G$ :

$S-A-B-D-G$

$S-C-D-G$

None of the above