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...) 3 2 10 4 6 7 5 6)b) [5pt] 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...)