Write a Java program to solve the N-Queens problem. Given an NxN chess board distribute N queens on the board such that each queen is safe from attack from the the other queens. Solve the problem for N=5, 6, 7, and 8. Do not print out each correct solution. Print out the count of correct solutions for each board size. Additionally, print out the NxN board showing how many times each square held a queen for each correct solution. You will be printing a total of 4 boards. A simple ascii board print is sufficient.