A vertex coloring of graph G = (V,E) is an assignment of colors to vertices of V such that each edge (x, y) implies that vertices x and y are assigned different colors. Give an algorithm for vertex coloring G using at most Δ + 1 colors, where Δ is the maximum vertex degree of G.