its question 7.16. basically, its asking me to create a recursive function with parameters(array [12][12], and the starting location). im assuming the starting location is a pointer. im confused on how to change the location of the starting pointer and how to create a correct recirsive function.

ation of a maze, In the two dime the dots represent squares i he two dimensional array, the hashes represent the walls of the m in the possible paths through the maze. Moves can be made only o if a maze, In the two dimensional array, the hashes re ent squares in the possible paths through the maze. M le algorithm for walking through a maze that guarantees your right and begin walling forward. N -canon in the array that contains a dot here is a simple algo here is h n. If there is not an exit rith finding the exit (assm t, you'll arrive at the starting location again. Place your ur right and begin walking forward. Never remove your hand from the hat t r there is a hand on the wall to yo nd on the wall to yo o forwar location iP vihe maze rurns to the right, you follow the wall to the right. As long as you do not remov sall li the maze turns to th g,1.22 Two-dimensi Two-dimensional array representation of a maze