I am trying to write a program to solve this problem for discrete math. I am trying to code the program in Java. We need to produce a truth table. One of the restrictions is that we are not allowed to use any logical operators in our functions. (&&, ||, !). Also, I want to make sure I print out “true” and “false” on the table. Not “1” and “0”. It looks like the table listed below.

Write a program with a language of your choice that produces a truth table for the following proposition: NOTE 1/ Your program must have the following functions: boolean implication( boolean p, boolean q) boolean or(boolean p, boolean q) boolean and(boolean p, boolean boolean biconditional(boolean p, boolean q) boolean negation(boolean p) q) 2/ Do not use || and && in your functions. 3/ Your program should use only six columns (one for each variable, and one for the given proposition.