I want the following question to be answered:

The question below is the reference for the above question:

9. (7 points) In class we saw a a poly-time reduction from 3-SAT to Subsec Sum. (a) Using the same 3-SAT input as from question 8 above (C1=(x1x2x3),C2=(x1x4x3),C3= (1x23)), write down the corresponding instance of Subset Sum that is built when following the reduction procediure we learned. Note you will be creating a Subset Sum instance, which is a set of integers and a target 8amW, from the 3-SAT input. (b) Show how a subset of the integers you created that sums to the target sum W: corresponds to a satisfying assignment of all k=3 clauses. 8. (7 points) Recall the reduction we saw from the 3-SAT problem to the Independent Set (IS) problem wherein the k clauses of the 3 -SAT instance were satisfiablo if and only if there was an IS in the corresponding graph of size at least k : (a) Given the following instance of 3-SAT, draw the corregponding graph for the IS instance. C1=(x1x2x3),C2=(x1x4x3),C3=(x1x2x3) (b) Then illusteate how how an independent set of size k=3 in the graph you draw corresponds to a truth-assignment that satisfies all k clauses in the 3-SAT formula