1. The knight’s tour problem asks if you can start with a chess knight in the upper-left corner of a chess board and move it so that it visits every square exactly once. A knight in chess makes moves that are two squares horizontally or vertically and one square in the other direction, in an L- shape. Answer the following questions about developing a backtracking algorithm to output a knight’s tour for an
OR
OR