java programming language

3. A bishop is a piece used in the game of chess which is played on a board of square grids. A bishop can only move diagonally from its current position and two bishops attack each other if one is on the path of the other. In the following figure, the dark squares represent the reachable locations for bishop B1 from its current position. The figure also shows that the bishops B1 and B2 are in attacking positions whereas B1 and B3 are not. B2 and B3 are also in non-attacking positions. Ba Now, given two numbers n and k, your job is to determine how one can put k bishops on an n n chessboard so that no two of them are in attacking positions. You are to make a Swing-based GUI program that allows the user to select n and k. It will then graphically display solutions to the problem. Solutions should be rotated at a reasonable rate and care should be taken to keep your program responsive