A) Depth First Search

Consider the problem represented by the following graph. Draw the search tree for each of the mentioned graph search strategies, work out the order in which states are expanded, as well as the path and the cost returned by each method. In all cases, assume ties resolve in such a way that states with earlier alphabetical order are expanded first. The start and goal state are S and G, respectively. Remember that in graph search, a state is expanded only once. h = 5 h=1 5 3 5 4 s h=6 B h = 4 G h=0 7 11 D h = 3 Consider the problem represented by the following graph. Draw the search tree for each of the mentioned graph search strategies, work out the order in which states are expanded, as well as the path and the cost returned by each method. In all cases, assume ties resolve in such a way that states with earlier alphabetical order are expanded first. The start and goal state are S and G, respectively. Remember that in graph search, a state is expanded only once. h = 5 h=1 5 3 5 4 s h=6 B h = 4 G h=0 7 11 D h = 3