base the template below, find solutions to the n number of queens on a nxn board.This project uses dynamic arrays and dynamic memory to accomplish its task. #include  #include  using namespace std; bool ok(int q[], int c) { // Reuse the ok function from your 1D 8 queens program. } // This function should return the number of solutions for the given board size (you don't need to print the solutions). int nqueens(int n) { // Dynamically declare an array of size n and initialize the first element to 0. // Reuse the code from your 1D 8 queens program to find the solutions (you may have to make changes). // Delete the array. // Return the number of solutions. } int main() { int n = 12; for (int i = 1; i <= n; ++i) cout << "There are " << nqueens(i) << " solutions to the " << i << " queens problem. "; return 0; }