Question: On an n*n chessboard, a knight starts at the cell (row, column) and attempts to make exactly k moves. The rows and columns are 0-indexed, so the top-left cell is (0, 0) , and the bottom-right cell is (n-1, n-1) . A chess knight has eight possible moves it…