We have already experimented with propositional logic and propositional

expressions.

a$)$ Write a python code function that would generate all interpretations of a

propositional expression for all its possible models. For simplicity, do not

use more than $2$ propositional formulae within an expression. For example

$($P $\backslash$cap Q$)\backslash$cup $($P $\backslash$cap $$Q$)$ etc.

b$)$ Print the value of the expression for all possible models i$.$e$.$ generate its

truth table $($doesn$$t have to be in the form of a table$).$

c$)$ Write a function which would check whether a pair of given propositional

expressions are equivalent to each other $($Recall that two or more

expressions are said to be equivalent to each other if they evaluate to the

same interpretation for each of the models. For example,$($p $->$ q $$p $$ q$).$

For simplicity, do not use more than $2$ propositional formulae within an

expression. You can reuse the code that you have written for the practical

exercises. The function could be of the form:

result $=$ equivalence$\_$test$($expression$1,$ expression$2)$