Suppose you are given a polynomial reduction from the Clique problem to the Satisfiability problem, both of which are stated as decision problems and known to be in class NP. Four statements are listed below. For each statement, determine whether it is true or false. Throughout this question, you should only use the information provided above, and not use any pre-existing knowledge about these problems. 1. If Clique is NP-complete, then as a result of this reduction, Satisfiability is also NP-complete. Select one alternative: True False 2. If Satisfiability is NP-complete, then as a result of this reduction, Clique is also NP-complete. Select an alternative True False 3. If Clique is in class P, then as a result of this reduction, Satisfiability is also in class P. Select an alternative True O False 4. If Satisfiability is in class P, then as a result of this reduction, Clique is also in class P. Select an alternative O True O False