part 2) depth-first

Applying Various Search Strategies to a State Space Assume that you have the following search graph, where S is the start node and G1 and G2 are goal nodes. Arcs are labeled with the cost of traversing them and the estimated cost to a goal is reported inside nodes. Apply the search strategies listed below to the search graph:, (a) indicate which goal state is reached if any, (b) list, in order, the states expanded, and (c) show the final contents of the OPEN and CLOSED lists. (Recall that a state is expanded when it is removed from the OPEN list.) When there is a tie with respect to which node has to be expanded next, nodes should be expanded in alphabetical order. The used search strategies include; 1. breadth-first depth-first 3. best-first (using = h) 4. A* (usingf-g+h) 5. SMA* (usingf-gth and limiting the open-list to just 3 elements) KEY cost of traveling this alcis X 0 estimated cost to heatest goal is Y