Write a program that uses recursive function to identify the path in a given maze. The layout of the maze is written in a file called βmazexxx.txtβ (xxx represent three digit, maze123.txt) that contains a two dimensional array. The array has β0β, β1β, βSβ,βFββ as its values. β0β indicates the square that is blocked and β1β indicates the square that you can go through. βSβ indicates the starting square and βFβ indicates the finishing square. See below for an example layout of a maze.
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 |
| 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 |
| 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 |
| 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 |
| 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 |
| 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 |
| 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 0 |
| 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 |
| 0 | S | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | F | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
Your program should also display the found path by drawing βXβ along the path (see below) and write the maze with the found path to another file called βsolxxx.txtβ (e.g., sol123.txt).
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | |
| 0 | X | X | X | X | X | X | X | X | 0 | 1 | 1 | 1 | 1 | 0 |
| 0 | X | 0 | 0 | 0 | 0 | 0 | 0 | X | 0 | 0 | 0 | 0 | 1 | 0 |
| 0 | X | 1 | 1 | 1 | 1 | 0 | 0 | X | 1 | 1 | 1 | 1 | 1 | 0 |
| 0 | X | 0 | 0 | 0 | 1 | 0 | 0 | X | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | X | X | X | 1 | 1 | 0 | 0 | X | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | X | 0 | 0 | 0 | 0 | X | X | X | X | 1 | 1 | 0 |
| 0 | 0 | 0 | X | 0 | 0 | 0 | 0 | 0 | 0 | 0 | X | 0 | 1 | 0 |
| 0 | 0 | 0 | X | X | X | X | X | X | 1 | 0 | X | 0 | 1 | 0 |
| 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | X | 0 | 0 | X | 0 | 1 | 0 |
| 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | X | 0 | 0 | X | 0 | 0 | 0 |
| 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | X | 0 | X | X | 1 | 1 | 0 |
| 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | X | 0 | X | 0 | 0 | 0 | 0 |
| 0 | S | X | X | X | X | X | X | X | 0 | X | X | X | F | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
Β



