Consider the search space below, where S is the start node and G1, G2, and G3 satisfy the goal test. Arcs are labelled with the cost of traversing them and the estimated cost to a goal is reported inside nodes. Indicate which goal state is reached (if any) and list, in order, all the states for: Depth first, Breadth First G3 G1 G2 Provide the search tree for your solution, showing the order in which the nodes were expanded and the cost at each node and State the path you would take and the cost of that path. Show for each search algorithm, the full algorithm steps, node cost and total cost of the path