For the given state$-$space graph, in what order are the states expanded if S is the starting node and G is the goal node? Assume that neighbors are explored in the left$-$to$-$right order, i$.$e$.,$ left is explored before the right.

image.png

$$

Depth$-$First Search

$[]$

Breadth$-$First Search

$[]$

Uniform$-$Cost Search

$[]$

Iterative$-$Deepening Search