Consider the CNF below

Consider the CNF below where x_i means complement of x_i: (x_1 x_2 x_3) (x_1 x_2 x_3) (x_1 x_3) (x_2 x_3 x_4). 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? 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 G? Suppose G = (V, E) is a spanning tree. Describe an algorithm that would efficiently compute a minimum vertex-cover for G