Write a C++ program that, given a starting point, finds its way out of a maze. The maze’s map will be read from a file at the start of the program. Your code must work for all legal mazes.. The maze is a rectangular grid represented as a 2D array, and the exit (if there is one) should be placed on an outer row or column of the play area. The program should run until the exit to the maze is found or until it is determined that there is no exit (after exploring all traversable cells). Exploration of the maze is done by recursively invoking a function and marking the cells visited with a special character (an electronic bread crumb to keep from revisiting explored cells). The legal moves are to cells adjacent but not diagonal to the cell currently occupied. Candidates for the next move are cells that are traversable and have not been previously visited. If the specially marked exit cell is encountered the game should exit with a message that the exit was found. Otherwise, after exploring the whole maze, a message is output stating that there is no exit.
i am also attaching project word whole description file so please read that too for more requirement details
hereby i am also attaching all the maze.h files and this project has to be done using recursion function and backtracking