Use the following information to find if a possible solutionexists for an input maze.
The rules of traversal are:
S – represents the starting point (start)
D – represents the ending point (destination)
X – represents a cell you cannot enter
B – represents an open cell you can travel to(converted to a blank space withinprogram)
# – represents a border cell
* – represents a cell you have already traveled to
@ – represents a cell that you found lead to an impossiblesolution
Travel from point S to point D using arecursive function solvemaze. Please usethe function provided(void solvemaze(mazetype & maze, int row,int col, bool & found, int
OR
OR