Problem 2 Let 4COLOR = {(G) : graph G is colorable with 4 colors). Describe a polytime function f reducing 4COLOR to CNFSAT, so that if G has n vertices and m edges, then f(G)) = (6), where o is a cnf-formula with O(n) variables and Om+n) clauses. Give a precise formulas (in terms of n and m) for the number of variables in your formula. Also, for each clause size k used by your formula, give a precise formula for the number of clauses of size k. Problem 2 Let 4COLOR = {(G) : graph G is colorable with 4 colors). Describe a polytime function f reducing 4COLOR to CNFSAT, so that if G has n vertices and m edges, then f(G)) = (6), where o is a cnf-formula with O(n) variables and Om+n) clauses. Give a precise formulas (in terms of n and m) for the number of variables in your formula. Also, for each clause size k used by your formula, give a precise formula for the number of clauses of size k