Use the Welsh-Powell algorithm as presented in class (not some other modification of it) to determine a vertex coloring for the following graph. You must show a trace of the vertex coloring. Finally, determine whether the coloring that results from the Welsh-Powell algorithm is a coloring with a minimum number of colors