In JAVA, 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. Sudoku

Write a program that can solve a Sudoku puzzle. You can put the puzzle you want to solve into your source code as a 2D integer array.