Let p $=($x$1$v x$2$ v $-$x$3)^(-$xlv $-$x$2$ v x$3)$ A $(-$xlv x$2$ v $-$x$3)$

Reduce the CNF$-$SAT to an instance of the clique decision problem. Prove that graph G has a clique only if CNF is satisfiable.

Find an assignment of truth values to the variables x$1,*2,$ and x$3$ that makes the entire formula true.

And find what is the maximum size clique possible.

$[6)$