$4.)$ Depth First Search $($DFS$).$ When expanding, expand from left to right $($i$.$e$.,$ if a child has two nodes, add the one on the left to the fringe first$).$ Although you will need to use a stack and set $($to keep track of visited states$),$ you do not need to draw them here for points$/$correctness$,$ but you may want to draw them on scrap paper below to help.

$\backslash$table$[[,,,,No,$les$/$Pat$,$s on Fri,,,,$],[\backslash$table$[[$Iteration$],[$#