Discrete Math and Computer Science:

Given a compound propositional logic statement, give the following as an 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).

input: [p (q-> r)]-> (q-r) Output: a. Truth table with all intermediate steps T T F T F F T T F TF F F T b. Simplified Expression: T (the given expression is a Tautology)