Prove that{,, FALSE}is functionally complete, i.e., any propositional formula is equivalent to one whose only connectives areand, along with the constant false. Prove using a series of logical equivalences. You may assume any logical equivalences we studied in class and the fact that any formula is equivalent to some formula in DNF.

Note: If you make the statement that a set of operators is functionally complete, and use this in your proof, then you need to justify your statement.