4.2 Coloring, with the oracle's help. Analogous to the previous problem, but a little trickier: suppose we have an oracle for the decision problem GRAPH k-CoLORING. Show that by asking a polynomial number of questions, we can find a k-coloring if one exists. Hint: how can we modify the graph to indicate that two vertices are the same color, or that they are different