To be done in JAVA

2-D Array Write a program that takes an integer N from user and creates an N-by-N boolean array a [] [] such that a[i][j] is true if i and j are relatively prime (have no common factors), and false otherwise. Border rule: when one or both of the index number is 0 or 1, the value is false. Method requirement: you must use separate method to determine the two numbers are relatively prime