given the search problem below, please find about from S to G

1) if we use depth first search in which order the nodes are checked (the sequence of nodes removed from fringe)

2) if we breath first search in which order the nodes are checked (the sequence of nodes removed from fringe)

2. Given the search problem below, please find a path from S to G. (1) If we use depth first search (DFS), in which order the nodes are checked? (the sequence of nodes removed from fringe) (2) If we use breath first search (BFS), in which order the nodes are checked? (the sequence of nodes removed from fringe)