Problem 2. Consider the CNF below where T means complement of r Convert this CNF into a graph G = (V, E) so that G has a clique of size 4 if and if the CNF is satisfiable. Does G have a clique of size 4? Problem 3. For the graph G = (V,E) above construct the complement graph G = (V,E). what is the largest clique in G? what is the largest vertex-cover in Problem 4. Suppose G V,E) is a spanning tree. Describe an algorithm that would efficiently compute a minimum vertex-cover for G