Depth$-$Frist Search $($DFS$)(3$pts$)$

Similar to BFS$,$ write a method that does a depth$-$limited search from a given cube, returning the first sequence of moves found that reaches the solution state. Like the previous part, add a $"$dfs$"$ command$-$line command that allows a user to perform the DFS on a given file representing the state:

$>$ sh run.sh dfs $"$ SBP$-$level$0.$txt$"$

$(2,$left$)$

$(3,$left$)$

$(2,$right$)$

$(3,$down$)$

$(4,$left$)$

$(4,$left$)$

$(2,$up$)$

$(3,$right$)$

$(3,$right$)$

$(4,$down$)$

$(2,$left$)$

$(2,$up$)$

$5,4,$

$1,2,2,1,1,$

$1,0,0,3,1,$

$1,0,0,4,1,$

$1,1,1,1,1,$

$15$

$0\mathrm{.}0012$