Java homework!

(10 points) The classic Eight Queens puzzle is to place eight queens on a chessboard such that no two queens can attack each other (i.e., no two queens are on the same row, same column, or same diagonal). There are many possible solutions. A sample output is shown below: 101 11111 1111 101 1 10 110 11 I 101 Assume that: You have a board: char [] board; You have placeQueens function that randomly places eight queens on the board. You have is Occupied function that returns true if the element in x is the char Q. You have getRow and getColumn function that returns the row number and column number that corresponds to the given index. Write a program that reads the integers between 1 and 100 and counts the occurrences of each. While solving the question please use an array. Assume the input ends with 0. Here is a sample run of the program: Sample Output: Enter the integers between 1 and 100:25 6 5 4 3 23 43 20 2 occurs 2 times 3 occurs 1 time 4 occurs 1 time 5 occurs 2 times 6 occurs 1 time 23 occurs 1 time 43 occurs 1 time