C++ Recursion: Please help me with the following program. No loops except for creating the board, no classes, no vectors (use 2D-arrays and 1-D arrays), and no libraries. I know it's been done, but I haven't found one that is like this. One that doesn't use the geeks4geeks code or special libraries or loops. It is for a beginner class. Use the boolean function for moveKnight, please. Thank you!!

In the game of (International) Chess the knight moves in an unusual pattern of 2 squares horizontally and then 1 square vertically or 2 squares vertically and then 1 square horizontally. The 8 possible moves for a knight are shown below: Somewhere along the line the question was asked: Could a knight move to every location on a chess board without ever landing on a square more than once. This challenge is known as the Knight's Tour. Your assignment is to come up with a recursive solution to the Knight's Tour. As your knight travels the board record the squares that he has touched by storing the move count, so for example the first square that the knight starts from would be marked with a 1 and the next square that the knight moves to would be marked with a 2 and so on until on a normal 8x8 chess board the knight moves to the last square and stores a 64 there....the knight would have them completed his tour. For this assignment, it is ok to use some global variables for recording some of the statistics you may want ( move count, tries, board, ect ). Remember in recursion you call a function to solve a problem, then the function will call itself to solve the next step of the problem. This wo on until the function gets to some ending solution. In this case, your function would be a move for the knight, and it would call itself for the next place to try moving to, which would call itself for the next place to move, and so on, and so on. Programming Note: - Think about what information needs to be passed into the function and what information needs to be returned from the function. - What are the things that you need to do in a square? For output from the program, you need to print out a map of where the knight visited in his tour. Here is an example of a Knight's Tour for starting from the upper left corner: bool moveKnight( int row, int col, int movNum); The boolean return value I used as a signal of the results of the function; false meant this call could not move further, true meant that the end was found (eventually) from this move. This is just a way of thinking of it, and your are not required to have the same function prototype. Use setw while printing out your board so that you output is clean and easier to read