Exercise 2 (2 pts). 1. Suppose that a decision problem can be solved by an algorithm running in time O(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(2(log n)2 ).