Write a program using recursion that will find all the solutions to the eight queens problem. In this problem, you are to place eight queens on a chess board so that no queen can reach the square of another queen in a single move. A chess board is an eight by eight square matrix of squares. A queen is able to move any number of squares in a straight line either up-down, left-right, or on either diagonal. This problem must be solved using recursion. Print a view of the board for each solution. Eliminate at least half of the mirror image solutions. Include a paragraph explaining how you eliminated these mirror images.