relevant comments and indentations should be included.

Q1: (Recursive Maze Traversal) (75 points) The following grid is a double-subscripted array representation of a maze The # symbols represent the walls of the maze, and the periods (.) represent squares in the possible paths through the maze. There's a simple algorithm for walking through a maze that guarantees finding the exit (assuming there's an exit). If there's not an exit, you'll arrive at the starting location again. Place your right hand on the wall to your right and begin walking forward. Never remove your hand from the wall. If the maze turns to the right, you follow the wall to the right. As long as you do not remove your hand from the wall, eventually you'll arrive at the exit of the maze. There may be a shorter path than the one you have taken, but you're guaranteed to get out of the maze Declare and initialize a 2-D array of characters using the maze given above. Write a recursive function mazeTraverse to walk through the maze. The function should receive as arguments a 15-by-15 character array representing the maze and the starting location of the maze. You may use a 15x16 maze if you want to initialize the 2-D array using strings instead of individual characters. You may pass additional parameters to your recursive function call if needed. As mazeTraverse attempts to locate the exit from the maze, it should place the character. in each square in the path that it steps on to show the progress. The function should display the maze after each move, so the user can watch as the maze is solved