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