exercise 4 is true or false. please make sure you answer all four thank you.

Exercise 3 (2 pts). Consider the following decision problem: Given a graph G and an edge e in it, determine whether G has a cycle containing e. Is this problem in P? Yes, no, unknown? Justify your answer (if your answer is "yes", briefly describe a polynomial-time algorithm) Exercise 4 (1 pt for each correct answer). 1. True, false, or unknown: Every problem in NP can be solved in polynomial time. 2. True, false, or unknown: Every problem in NP cannot be solved in polynomial time. 3. True, false, or unknown: Every problem in EXP can be solved in polynomial time. 4. True, false, or unknown: Some problems in EXP can be solved in polynomial time