please help me with question!!

thanks

Consider the following search problem, represented as a graph. The start state is S and the only goal state is G. In all cases, assume ties resolve in such a way that states with earlier alphabetical order are expanded first. Note that the following problems variously reference both tree search and graph search. What path will Uniform Cost graph search return