Consider the following propositional logic formula:
(A ∧ B) → (C ∨ ¬D)
Where A, B, C, and D are propositions. Assume that A and B are true and C is false.
a) Create the truth table for the formula.
b) Using the truth table, determine whether the formula is true or false.
c) Draw a logic gate diagram for the formula using AND, OR, and NOT gates.
d) Convert the formula to conjunctive normal form (CNF) and draw the corresponding graph using nodes and edges.
e) Explain how the graph representation of the formula can be used to find the satisfying assignments for the formula.