Consider the search space below, where $S$ is the start node and $G$ 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 the fringe list. When all else is $.$equal, nodes should be removed from fringe in leftmost order

Depth First Search $.1$

$\backslash$table$[[$Expanded Nodes,Node list$],[$S$,$S$],[$A$,$A B C$],[$D$,$D E G B C$],[$E$,$E G B C$],[$G$,$G B C$],[$Solution path found,S A G$],[$Total Cost,$18],[\backslash$table$[[$Number of nodes expanded$],[($including goal node$)]],5]]$

Complete the implementation of the following search :strategies

Breadth First Search $.2$

Uniform Cost Search $.3$

Iterative Deeping Search $.4$