IN HASKELL JUST SOLVE EXERCISES 3, 4, 5, and 6, I WILL VOTE WITH YOUR HAND UP AS SOON AS POSSIBLE IF YOU HELP ME, 1. DO NOT WRITE THE CODE ON PAPER 2. MAKE THE CODE IN PROGRAM

module Clase1 where type Literal = Prop type Clause = [Literal]

data Prop = Var String | Cons Bool| Not Prop | And Prop Prop | Or Prop Prop | Impl Prop Prop | Syss Prop Prop deriving (Show, Eq)

--converts a propositional formula into its negative normal form. exercise1 :: Prop -> Prop --function already implemented, do nothing here

--converts a propositional formula into its normal form conjunctiva. exercise2 :: Prop -> Prop --function already implemented, do nothing here

--given a formula in FNC(Exercise2), returns a list with the clauses that form it. exercise3 :: Prop -> [Clause] --solve the function here...

--given two clauses, returns the resolvent obtained after applying the binary resolution rule. It can be assumed that a resolvent can be obtained from the arguments exercise4 :: Clause -> Clause -> Clause --solve the function here...

--determines if it is possible to obtain a resolvent from two clauses. exercise5 :: Clause -> Clause -> Bool --solve the function here...

--given a propositional formula, determines if it is satisfiable or not using the saturation algorithm. exercise6 :: Prop -> Bool --solve the function here...