QUESTION $14$

Which solution would uniform cost search $($UCS$)$ find if we run UCS on the graph shown below?

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.$

A$.SABG$

$B.SABCG$

C$.SDG$