The diagram below shows an undirected graph G:

a. Show the coloring produced by the greedy algorithm when the vertices are colored in the following order:

b, d ,e, a, c, f

b. Give a coloring of the graph that uses the fewest number of colors possible.

C b d a e f