Design and implement an algorithm for solving a maze. Produce ASCII output indicating path. The problem description is taken from Carrano Chapter 5 Problem 9 (Carrano Chapter 5, Problem 4 in 6th edition) which is linked to this assignment.
The maze is provided by a text file in the following format:
20 7
0 18
x
x x x
x xx x
x xx x
x x xx xx x
x xx x

The first 2 numbers are: width-of-maze, height-of-maze
The next 2 numbers are: row-exit column-exit
x represents wall
space represents movable space
Unlike the textbook version, the entrance to the Maze is not specified as part of the maze. txt file but will be provided by Creature's location
When maze is printed, you should also add
* part of the path to exit
+ visited square not part of the path to exit
When the solved maze is printed, you should get (without color)
Path:
*x
x x*x
x xx*x
x **xx*x
x x+xx*xx*x
x +xxx

Above maze has "red *" to indicate path, "green star" to indicate starting location and "+" to indicate explored areas that are not part of the final path to exit.
The ASCII representation of the maze is important for debugging, but does not have to be exactly as above. The Path string has to exactly match the solution.
You can assume that mazes will have less than 100 rows and 100 columns.
You need to submit ass3.zip with the following files in it. Put all the files below into a folder called "ass3", create a zip file of the folder and submit it. Do not submit executables or other files from IDE. See https://github. com/pisanorg/w/wiki (Links to an external site.) > "Creating a zip file" if you need to.