Write pseudocode and Java code to print all possible paths inluding valid and invalid paths, from $S$

$($start$)$ to $E($end$)$ in the maze depicted in the image.

What to submit:

Report that includes:

pseudocode

Java file