This question belongs to Theory of Computation. Pleasehelp if you can
Exercise 2 A 2-CNF formula is a formula of propositional logic in which each clause has eractly two literals. That is, the formula is a conjunction of clauses, where each clause is of the form 4 or 4 v 12 where each 4 is either p or ) for some atomic proposition p. (Note that we may treat a single literal as equivalent to
OR
OR