can someone please do this code in C++ and should be able to compile in a compiler like Visual Studio

In the game of chess, a queen is the most "powerful" piece which can move any number of squares vertically t, horizontally (-), or diagonally in the chessboard. The n-Queens problem is to put n queens on an n n chessboard so that the queens cannot attack each other. That is, no two queens share the same row, column, or diagonal. In this assignment, you will use two-dimensional arrays to write a program to put queens on the board one by one. Figure 1 shows an example 18 18 board configuration. In the figure, 'Q' denotes a queen,',' denotes an empty square, and '' denotes a square that is attacked by a queen. The rows and columns are named in numbers (0-17) and uppercase letters (A-R) respectively. Note that a necessary (but not sufficient) condition to solve the n-Queens problem is to have exactly one queen on each row and on each column. A BCDEFGHIJ K L M NO P QR 1 2 4 7 10 12 . 15 No. of Queens - 2 Figure 1: An Example 18 18 Board Configuration Program Specification This section describes the chessboard representation, program flow, and some special requirements. Chessboard Representation The chessboard will be represented by a two-dimensional array of chan. The array elements should