Implement and test the maze searching program described in Section 2 of Chapter 11. Provide two implementations: one that performs a depth-first search and another that performs a breadth-first search.
For the complexity analysis assume that the total number of cells in the maze is n.
Express the worst and best case time and storage complexities as a function of n.
List only the complexities of the visit and solveMaze functions.