Here my answer for Q3:

A)

b)

c)

d)

e)

f)

4. Problem 4: Davis-Putnam Trace the action of the Davis-Putnam algorithm applied to the clauses in problem 3 (you have already converted them to CNF). Assume that when the algorithm encounters a branch point, it selects the first atom in alphabetical order, and that it tries TRUE before "FALSE". (CAVB VC) A ( - BVA), A (- cun) (ANG) N (-eva) Forc) a (-evo) -GVE -EV-G CEVA) W (-0 VA) 4. Problem 4: Davis-Putnam Trace the action of the Davis-Putnam algorithm applied to the clauses in problem 3 (you have already converted them to CNF). Assume that when the algorithm encounters a branch point, it selects the first atom in alphabetical order, and that it tries TRUE before "FALSE". (CAVB VC) A ( - BVA), A (- cun) (ANG) N (-eva) Forc) a (-evo) -GVE -EV-G CEVA) W (-0 VA)