Recursion, C++

The circle on the initial space is a marker that can move to other spaces along the row At each,tep ir- the puzzle, you may move the marker the number of spaces indicated by the integer m the space it currently occupies. The marker may move either left or right along the row but may not move past either end For example, the only legal first move is to move the marker three spaces to the right because there is no room to move three spaces to the left. The goal of the puzzle is to move the marker to the position that stores a 0. In this configuration, you can solve the puzzle by In this puzzle, you can bounce between the two 3's, but you cannot reach any other spaces. Write a program that reads in a file of putties of this type and determines if each puzzle is solvable write a function boo that takes the current position of the marker along with the array of spaces and the puzzle s effective site. The function should return true if It Is possible to solve the puzzle from the starting configuration and false it is impossible Details: No puzzle Will contain more than 100 possible locations (counting both the beginning and the ending positions). Beginning position is always index zero The final position is the index that stores a zero. It does not have to be at the end of the puzzle As your program analyzes the putties, write messages to the screen showing the progress. file given on Module to see what to show. The file contains an unknown number of putties Each puzzle will be on its own line The first number on each line reveals how many numbers are in the puzzle, the remaining numbers are the puzzle itself. The circle on the initial space is a marker that can move to other spaces along the row At each,tep ir- the puzzle, you may move the marker the number of spaces indicated by the integer m the space it currently occupies. The marker may move either left or right along the row but may not move past either end For example, the only legal first move is to move the marker three spaces to the right because there is no room to move three spaces to the left. The goal of the puzzle is to move the marker to the position that stores a 0. In this configuration, you can solve the puzzle by In this puzzle, you can bounce between the two 3's, but you cannot reach any other spaces. Write a program that reads in a file of putties of this type and determines if each puzzle is solvable write a function boo that takes the current position of the marker along with the array of spaces and the puzzle s effective site. The function should return true if It Is possible to solve the puzzle from the starting configuration and false it is impossible Details: No puzzle Will contain more than 100 possible locations (counting both the beginning and the ending positions). Beginning position is always index zero The final position is the index that stores a zero. It does not have to be at the end of the puzzle As your program analyzes the putties, write messages to the screen showing the progress. file given on Module to see what to show. The file contains an unknown number of putties Each puzzle will be on its own line The first number on each line reveals how many numbers are in the puzzle, the remaining numbers are the puzzle itself