The polynomial-time reduction from SAT to CSAT, as described in the class videos needs to introduce new variables. The reason is that the obvious manipulation of a Boolean expression into an equivalent CNF expression could exponentiate the size of the expression, and therefore could not be polynomial time. Suppose we apply this construction to the expression (u+(vw))+X, with the parse implied by the parentheses. Suppose also that when we introduce new variables, we use y1, y2, ... After constructing the corresponding CNF expression, identify one of its clauses from the list below. Note: logical OR is represented by +, logical AND by juxtaposition, and logical NOT by - (y2+u) (y2+y1+u) (y3+-y2+-y1+w) (-y1+w) In the following expressions, - represents negation of a variable. For example, -x stands for "NOT X"), + represents logical OR, and juxtaposition represents logical AND (e.g., (x+y) (y+z) represents (X OR Y) AND (Y OR z). Identify the expression that is satisfiable, from the list below. (x+-y) (-y+z) (-x) (-2+x) C (X+-y) (y+z) (-2+x) (-x) (x+y) (-x) (X+-y) (y+z) (x) (-x+y) (-X+-y) (y+z) o