A graph Ghas a 3-coloring if there is an assignment of at most three "colors" to the nodes of the graph such that no two adjacent vertices share the same color. 6 4 2 Assume that G is an undirected graph. Give an implementation description of a nondeterministic Truing machine that does not generate all possible ways to color the graph, and accepts the language B ={ | G has a 3-coloring). A graph Ghas a 3-coloring if there is an assignment of at most three "colors" to the nodes of the graph such that no two adjacent vertices share the same color. 6 4 2 Assume that G is an undirected graph. Give an implementation description of a nondeterministic Truing machine that does not generate all possible ways to color the graph, and accepts the language B ={ | G has a 3-coloring)