Using C++ allow a user to input a compound propositional logic statement that contains no more than 3 unique variables and generates the following output:

a) A truth table for the expression starting from individual propositional logic statements and showing all intermediate steps.

b) A simplified version of the statement (ONLY if it is possible to simplify the expression using inference rules).

Example: Input: [DA (q r)] (q r) Output: a. Truth table with all intermediate steps: F T T b. Simplified Expression: T (the given expression is a Tautology)