Search for question
Question

4. Consider the following 2-CNF formula. F=(a \vee d) \wedge(a \vee \neg d) \wedge(\neg b \vee e) \wedge(\neg e \vee \neg d) \wedge(d \vee b) \wedge(b \vee c) (a) Draw the digraph corresponding to F. (b) Use the digraph to list all satisfying assignments to F.

Fig: 1

Fig: 2

Fig: 3

Fig: 4