Recall that an undirected graph G = (V,E) is 3-colorable iff there is a map f: V {red, green,blue} such that no edge is assigned the same color to both its end points. Define 3COL = {(G) | G is a 3-colorable graph}. Give an explicit reduction showing that 3COL