uestion Completion Status:

QUESTION $12$

Which solution would depth$-$first tree search $($DFS$)$ find if we run DFS on the graph shown below? Start from $S.$ Goal state is $G.$

Assume that ties are broken alphabetically. For example, a partial plan $Sx$A would be expanded before $SxB$; similarly, $SAZ$ would be expanded before $SBA.($Enter a number only in the answer field for auto grading.$)$

A$.SABG$

B$.SABCG$

C$.SDG$