Determine whether the following statement is true or false. Briefly justify your answers. a. P is the class of all problems that can be solved in polynomial time. b. NP is the class of all decision problems that cannot be solved in polynomial time c. A problem is NP-complete if it is both NP-hard and in NP d. If SAT can be solved in polynomial time, all problems in NP can be solved in polynomial time. e. Suppose II_1 and II_2 are two decision problems and II_1 is polynomial time reducible to II_2, i.e., II_1 lessthanorequalto II_2. If II_1 is in NP, then II_2 is also in NP