In JAVA Coding ~

Problem: A Latin square is an n-by-n array filled with n different Latin letters, each occurring exactly once in each row and once in each column. Write a java program that prompts the user enter the positive integer n and either the array of characters or a file containing it and checks if the input array is a Latin square.

* Describe how you want to solve this problem: write this description as a comment at the top of your java file

* Put together a Java code that addresses the above problem. Properly comment your code to explain what it does and why the whole piece of code is an actual solution to the above problem.

(Any help will be greatly appreciated, as I seem to be running into multiple errors everytime I fix something. Thanks in advance)