Need it in java please

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, pos1)true) return true; clear any choices entered at pos on board; return false; I backtrack