9. In the proof (discussed in class) of the NP hardness of the 3SAT problem by re- duction from the SAT problem, we convert an arbitrary boolean expression in CNF (input of the SAT problem) to a boolean expression in 3CNF (where each clause has exactly three literals). (a) Please illustrate the conversion by giving the boolean expression that will be obtained from the following boolean expression: (v + )(w+x+y+2).(+2+x+7+3). (b) The original boolean expression is satisfiable. As a demonstration of why the reduction is correct. please use the resulting boolean expression to show that it is indeed the case