WRITE CODE IN C++. Here is the task:

Implement the solution for the N-Queens problem using stacks. Either define a fixed N or let the user define N (this should not affect the algorithm or its implementation details).

HAS TO FOLLOW THIS PSEUDOCODE:

DON'T FORGET TO IMPLEMENT IT WITH A MAIN FUNCTION!

Initialize stack push first queen position onto the stack, and filled-0 Repeat: if no conflicts with queens filled-filled+1; if filledN done else move to next row and place a queen in first column else if a conflict and there is room to shift ( move current queen to the right, adjusting the stack record (new position) else if there is a conflict and there is no room to shift [ Backtrack: keep popping the stack and filled-filled-1 until you reach a row where the queen can be shifted; shift that queen Initialize stack push first queen position onto the stack, and filled-0 Repeat: if no conflicts with queens filled-filled+1; if filledN done else move to next row and place a queen in first column else if a conflict and there is room to shift ( move current queen to the right, adjusting the stack record (new position) else if there is a conflict and there is no room to shift [ Backtrack: keep popping the stack and filled-filled-1 until you reach a row where the queen can be shifted; shift that queen