Question 1: Say about all these statements if they are true or not or are an open problem. Prove, or explain precisely your answer. Do not just indicate which of the four answers is correct. 1. The problem of finding if a graph has a clique U of size n 10 with n the number of vertices is polynomial 3. If we can solve the Hamiltonian path in time O(n4) then you can solve any other NPC problem in O(n4) time