5. Consider the following reduction involving the problems 3SAT and SUBSET-SUM-{(AC N, s):3/SA such that = s} A C N, s) : 1-A such that a-s ael The reduction is given a 3CNF Boolean formula p involving n variables ri 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 r or its negation T.) We construct the following numbers: 5. Consider the following reduction involving the problems 3SAT and SUBSET-SUM-{(AC N, s):3/SA such that = s} A C N, s) : 1-A such that a-s ael The reduction is given a 3CNF Boolean formula p involving n variables ri 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 r or its negation T.) We construct the following numbers