In the proof (discussed in class) of the NP-hardness of the clique problem by re- duction from the SAT problem, we convert an arbitrary boolean expression in CNF (input of the SAT problem) to an input graph to the clique problem. (a) Please illustrate the conversion by drawing the graph that will be obtained from the following boolean expression: (T + 2) : (x+y+z) (2 + y + z). (b) The original boolean expression is satisfiable. As a demonstration of how the reduction works, please use the resulting graph to argue that the original boolean expression is indeed satisfiable