PLEASE PROVIDE THE SOLUTION IN C++

Problem Statement: The n-queen problem is the problem of placing n queens on an nxn chessboard such that no queen can attack another queen. In other words, no two queens share the same row, column, or diagonal as shown in the following figure for 8-queens problem a b d f gh 8 8 7 7 w 6 6 5 M 5 4 M. 4 3 3 2 2 882 https://en.wikipedia.org/wiki/Eight_queens_ puzzle Backtracking Algorithm: I will introduce a common algorithm design technique called backtracking for solving this problem. The backtracking approach searches for a candidate solution incrementally, abandoning that option as soon as it determines that the candidate cannot possibly be a valid solution, and then looks for a new candidate. The search starts for 8-queen problem (n=8 now) from the first row with k = 0, where k is the index of the current row being considered. The algorithm checks whether a queen can be possibly placed in the jth column in the row for j = 0, 1, ..., 7, in this order. The search is implemented as follows: Your Program Your program defines the problem size N as a constant and based on N value, your program will find and print all solutions to the problem of placing n-queens on a chess board with the constraint that no queen can "take" any other queen. You can also use vector to create a board by taking the size of the board from the user. To test your program, you can compare your algorithm's results with the results in the following table. If the N is 7 or the greater than 7, your program can list first three solutions then write the total number of solutions that it found.) # of all solutions Problem size 4-queens 5-queens 6-queens 7-queens 8-queens 9-queens 10-queens 2 10 4 40 92 352 724 Here are the two solutions for n=4 1 2