The start and goal state are S and G,respectively. For each of the following graph search strategies, work out the order in which statesare expanded, as well as the path returned by graph search. In all cases, assume ties resolve in sucha way that states with earlier alphabetical order are expanded first.

C) 8pts Depth-first search (avoid infinite loops bychecking new states against those on the pathfrom the root to the current node)

h=6 S 1 2 6 h = 5 c 3 h=6 b h=8 a 3 6 6 20 h = 20e d) = 4 G) = 0 2. A 5 1 h=1