b$.$ For each of DFS and BFS Algorithms enumerate all partial paths that will be visited before finding the goal

node $G$ and give a snapshot of the fringe when $G$ is found.

DFS

$SESECSECASECAB$

$SECAD$

$SECAF$

$SECAFi$

$SE(A)FYG$

Fand goal

Fringe at the time of

finding the goal. Assume

we take nodes to expand

$\backslash$table$[[$G$,Y,F,A,L,E,S$