C++

Please read the question carefully and make sure that the intermedial steps for the proposition are also shown in the truth table.

Output should print 'T' and 'F' not 0s and 1s.

Write a program that produces truth table for the following compound propositions (your can use nested loops). Write the header(s) of the table(s), including intermedial steps and the final result. Output the result on thefile prog2 output.txt. 1. (p -> q) <-> (neg q -> neg p) 2. (p or q) and neg (p and q) 3. p and neg p