Exercise 2.8. Consider the following variation of SAT, which we will call opposite- SAT. The input consists of a collection of m disjunction clauses over n variables x1,...,xn. The goal is to decide if there is an assignment such that every dis- junction evaluates to false. For this problem, either (a) design and analyze a polynomial time algorithm, or (b) show that a polynomial time algorithm implies a polynomial time algorithm for SAT