$5)$ Take a blank piece of paper, and see if you can produce a correct psuedocode that inpute the an array of

Neighbors lists for a graph G with vertices numbered $1$ through $|$V $|.$ It should compute an array Color$[1..|$V $|]$

which contains a coloring of the $|$V $|$ vertices where no edge connects a pair of vertices with the same color.

And yes, a greedy method $($such as one that is in Chapter $1,$ should be used to compute a hopefully good

coloring. And it should run in a time that is proportional to the number of vertices plus edges in the graph.

Got stuck? Take a look at the code, and then close the book. Now try again. If necessary, repeat, and

include your latest effort as your solution.