solve a maze using stack and queue without recursion

Pseudo: 1) Push start position onto stack. 2) While it's not empty; 3) Pop from the stack to get the current considered location 4) If it's already explored ignore 5) If it's the goal, return true 6) If it's not the goal, then explore it. 7) You will need to compute all the possible neighbors. Then push those on the stack 8) Return false *) 1 usoge public static boolean solveMazestack(int x, int y ) throws EnptystackE \{ //initialize return fatse; 3 11 TODO: Using a queve, solve the naze. Be sure to exploin your algorithin for fult points. 1 usage public static bootean sotvekazequeue(int x, int y ) thrors EsptyqueveEt retuma false; ctor Build Bun Iooks ves Window Help HWS-maseti.t dector Ruild Pun Iools VCS window Help HW3-mazel tot