Maze Algorithms Solver
Create a program to generate and display several mazes of different sizes for the input to the maze solver. Save the images of the mazes.
Create a program that uses the wall follower algorithm, Trémaux’s algorithm, and dead-end filling algorithm to solve a maze (from the entrance to the exit).
Run the program on 4 mazes of increasing input size(common maze sizes, relatively large).
Calculate the running time of each algorithm on each input data size
Plot time complexity, input data size verses time to completion of algorithm.
Analyze the space complexity of each algorithm