Problem 2. Write a function

* Problem 3 (10 points): isNNF Write a function sNNF :: Prop-> Bool that tests whether a proposition is in negation normal form simplify Prop -> Prop that recursively translates a proposition to an equivalent simple one For this translation, the following equivalences will be useful: Testing for isSimple and simplify. Run (and pass) VrunTestTT testsSimp V quickCheck simpl prop V quickCheck simp2_prop DEFINITION. A propositional formula F is is in negation normal form (abbreviated: NNF) when: & and V are the only binary connectives F uses and the only place a ~ appears in F is before a variable