Write a program implementing greedy/list coloring. Your program should calculate three different colorings for one input graph using the following vertex ordering schemes:

a. High to low degree

b. Low to high degree

c. Random vertex ordering Your program should output the number of colors used and the wall-clock run time for each of the schemes. Your output should look very similar to the following:

Graph4.txt :

4 3 0 1 1 2 2 3 

a. High to low degree b. Low to high degree c. Random vertex ordering Your program should output the number of colors used and the wall-clock run time for each of the schemes. Your output should look very similar to the following /color graph 4. txt High to low 2 colors, 006 sec Low to high 3 colors 005 sec Random: 3 colors, 006 sec Note that different pseudo-random number generators and/or different seeds can produce different results