Traverse a maze recursively.
A sample maze has been provided. The actual maze will be larger. The start and end of the maze are represented with the characters + and -, respectively.
Sample maze: see image.
As your program moves through the maze the current path should also be marked with the + character. Any path leading to a dead end should be marked with the . character.
Upon reaching the end of the maze your program should print a message stating that the maze was solved. If your program does not find the exit this should also be stated.
Here is the actual maze file that will be used to test your programs: see image.