Exercise 2 (2 pts) 1. Suppose that a decision problem can be solved by an algorithm running in time 0(2clogn) where c is a constant. Is this problem in P? Yes, no, unknown? Justify your answer (if your answer is "yes", briefly describe a polynomial-time algorithm) 2. The same question for the algorithm running in time O(2log n) 3 (2 pts). Consider the following decision problem: Input: C) where G is a graph. Question: Does G contain a clique of size 3? Is this problem in P? Yes, no, unknown? Justify your answer (if your answer is "yes", briefly describe a polynomial-time algorithm)