Java Data Structures Problem (Backtracking) Code is below

public class NQueen { final int N = 5; /* A utility function to print solution */ void printSolution(int board[][]) { for (int i = 0; i =0 && j>=0; i--, j--) if (board[i][j] == 1) return false; /* Check lower diagonal on left side */ for (i=row, j=col; j>=0 && i= N) return true; /* Consider this column and try placing this queen in all rows one by one */ for (int i = 0; i   3. (20) Modify the NQueen java program so the code will print ALL of the possible solutions