Write a program that will read in the boolean matrix corresponding to a relation R and output whether R is reflexive, symmetric, anti-symmetric and/or transitive. Input to your program will be the size n of an nxn boolean matrix followed by the matrix elements Document your program nicely. Run your program on each of the following input matrices and cut and paste your output to your source code. Your program must output a reason in the case that an input relation fails to have a certain property Input matrices: 0 1 0 0 1 1 1 1 0 0 1 0 1 10 1 0 0 1 0 1 10 1 0 1100 0 1 01010 0 0010 0 0 10 01 1 0 011 0 1 001 0 1 1 Write a program that will read in the boolean matrix corresponding to a relation R and output whether R is reflexive, symmetric, anti-symmetric and/or transitive. Input to your program will be the size n of an nxn boolean matrix followed by the matrix elements Document your program nicely. Run your program on each of the following input matrices and cut and paste your output to your source code. Your program must output a reason in the case that an input relation fails to have a certain property Input matrices: 0 1 0 0 1 1 1 1 0 0 1 0 1 10 1 0 0 1 0 1 10 1 0 1100 0 1 01010 0 0010 0 0 10 01 1 0 011 0 1 001 0 1 1