In: Advanced Math
Give an example of proof by construction.
For example, prove that for every well-formed formula f in
propositional logic, an equivalent WFF exists in disjunctive normal
form (DNF).
HINT: Every WFF is equivalent to a truth function, and we can
construct an equivalent WFF in full DNF for every truth function.
Explain how.