Q$2(10$ pts$)$: Consider a depth$-$first graph search on the graph below, where $S$ is the start and G

is the goal state. Assume that ties are broken alphabetically $($so a partial plan S$->$X$->$A would be

expanded before S$->$X$->$B and S$->$A$->$Z would be expanded before S$->$B$->$A$).$ You may find it

helpful to execute the search on scratch paper.

Please enter the final path returned by depth$-$first graph search in the box below. Your answer

should be a string with $S$ as your first character and $G$ as your last character. Don't include

arrows or spaces in your submission. For example, if you believe the path is S$->$X$->$G$,$ please

enter SXG in the box. $($Please write your answer in uppercase letters, e$.$g$.,$ SXG$,$ rather than

sxg$.)$