5. Consider the following reduction involving the problems 3SAT and SUBSET-SUM {(A C N, s) : 3/ C A such that a = s). aEI The reduction is given a 3CNF Boolean formula p involving n variables r and m clauses cj, where we can assume without loss of generality that no clause is duplicated. (Recall that each clause is the OR of exactly three literals, where a literal is either some variable or its negation -) We construct the following numbers: 5. Consider the following reduction involving the problems 3SAT and SUBSET-SUM {(A C N, s) : 3/ C A such that a = s). aEI The reduction is given a 3CNF Boolean formula p involving n variables r and m clauses cj, where we can assume without loss of generality that no clause is duplicated. (Recall that each clause is the OR of exactly three literals, where a literal is either some variable or its negation -) We construct the following numbers