Please help me with this project using JAVA.

1. Backtracking with Recursion - Featuring Chess Choose and complete one of the two following chess problems. These problems can be solved using the backtracking algorithm shown below. boolean solve(board, pos){ if( pos is such that there is nothing left to solve){ return true; } for each possible choice { if(valid(choice)){ mark board at pos with choice; if(solve(board, pos + 1) == true){ return true; } } } clear any choices entered at pos on board; return false; // backtrack }

2. The Eight Queens Problem Write a recursive method which solves the eight queens problem. You must nd a state where you can place eight queens on a chessboard such that no queen can capture another queen. Queens can move and capture pieces in the same row, column, or any diagonal. You may use an 8 8 int[][] array to represent your chess board. An example solution is below.

Hint: only one queen can be placed in each column.