Q$1/$ Consider the search space below, where S is the start node and G$1$ and G$2$ satisfy the goal test. Arcs are labeled with the cost of traversing them $($so lower is better$).$ For each of the following search strategies, indicate which goal state is reached $($if any$)$ and list, in order, all the states popped off of the fringe list. When all else is equal, nodes should be removed from fringe in alphabetical order.

Breadth First

Goal state reached:

States popped off the fringe:

Depth First

Goal state reached:

States popped off fringe:

Uniform$-$Cost Search

Goal state reached:

States popped off fringe: