make a program, which for a number N (4 IMPORTANT NOTE: Precalculations are not admitted, the program must calculate the solutions.For testing, the results should be: Size N Different solutions Total...

make a program, which for a number N (4 <= n=""><= 10)="" calculates="" in="" how="" many="" different="" ways="" n="" queens="" can="" be="" placed="" on="" a="" board="" of="" nxn="">

IMPORTANT NOTE:
Precalculations are not admitted, the program must calculate the
solutions.
For testing, the results should be:

Extracted text: Size N Different solutions Total solutions(without deleting repetitions) 4 1 5 10 1 7 6 40 8 12 92 46 352 10 92 724 11 341 2680 12 1787 14200 4