Assume 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. KEY newest goal is X Cost of weig this are is Y GI For each of the search strategies listed below, write in order the states expanded and total path cost to reach a goal. (Recall that a state is expanded when it is removed from the OPEN list.) When all else is equal, nodes should be expanded in alphabetical order. a. Depth-first search b. Breadth-first search c. A* search Assume 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. KEY newest goal is X Cost of weig this are is Y GI For each of the search strategies listed below, write in order the states expanded and total path cost to reach a goal. (Recall that a state is expanded when it is removed from the OPEN list.) When all else is equal, nodes should be expanded in alphabetical order. a. Depth-first search b. Breadth-first search c. A* search