java not c

In this assignment you will write a Java program that finds all solutions to the n-Queens problem, for lsns13. Begin by reading the Wikipedia article on the Eight Queens puzzle at: In the game of Chess a queen can move any number of spaces in any linear direction: horizontally, vertically, or along a diagonal. The Eight Queens puzzle is to find a placement of 8 queens on an otherwise empty 8x8 chessboard in such a way that no two queens confront each other. One solution to this problem is pictured below. The n-Queens problem is the natural generalization of placing n queens on an nxn chessboard so that no two queens confront one another. There are many ways of solving this problem. Our approach will be to start with a solution to the n-rooks problem (i.e. place n Rooks on an nxn chessboard so that no two rooks attack each other) then check if that arrangement is also a solution to -Queens. The rook move in chess is similar to the queen's move except that it cannot move diagonally