(c) The N-queen problem is to place N queens on an N x N chessboard in such a way that no Queen is being attacked by another Queen cither diagonally, horizontally or vertically. Three steps of the...

Extracted text: (c) The N-queen problem is to place N queens on an N x N chessboard in such a way that no Queen is being attacked by another Queen cither diagonally, horizontally or vertically. Three steps of the backtracking algorithm used to solve the N-Queen problem are as follows: Step 1: Place one queen on a new spot on the board so that it is not being attacked by any other Queen already on the board. Step 2: If successful, go to step 1, else go to step 3. Step 3: Remove the queen that was last placed on the board, then go to step 1. Using the algorithm described above, complete the solution for the 5-Queen problem by placing the other 4 Queens on each of the following chessboards. Q Q