Write a well-documented (commented) program, RelativelyPrimeArray, that takes an integer command-line argument n and creates an (n+1)-by-(n+1) Boolean array rpa such that rpa[i][j] (for i,j>0) is true if i and j are relatively prime (have no common factors), and is false otherwise. It should then output as is shown by the sample run below. If the indexes i,j (for i,j>0) are equal, it should output a single space. If the indexes are not equal, then it should output a "T" character if the array element specified by the indexes is true or an "F" character if it is false.