Question $6$: $[10$pt total$]$

a$)[5$pt$]$ Apply the Greedy Coloring Algorithm to the following graph: $($You should color the vertices in the order indicated, and use the "colors" $A,B,C,D,$ etc...$)$

b$)[5$pt$]$ Find a proper coloring of the right graph which uses the fewest possible number of colors: $($You should use the "colors" $A,B,C,D,$ etc...$)$