Write a Java code method (call it checkState) that accepts a 2-dimensional array of integers that represents an N-Queen proposed solution (The contents of the array are just 1's and 0's where 1's represent the placement of a queen). The method checks whether the array represents a solution or not. What are the best and worst cases?