Write a Maze Explorer program that uses stacks and queues to implement an algorithm to escape from a maze. The overall pseudocode of the algorithm is the following. The algorithm can be implemented using a stack or a queue. What are the pros and cons of each?

create an empty stack of locations to explore. push the start location onto the stack. while (stack is not empty) { pop a location L from the stack. if we have we pulled L from the stack before: no need to explore it again, so skip L. if L is the end location: the end was reachable! else, L is a new reachable non-finish location, so explore it: add all non-wall adjacent maze locations to the stack. record the fact that we have explored L. if the stack is empty, the finish is unreachable.