Question: 1. Does there exist a graph with largest degree equal to twice the chromatic index? If so, give an example, and if not, explain why not.
2. What does this list of instructions do? Comment on whether it is an algorithm and whether it terminates.
1. Let n = 2.
2. Replace n with n+3.
3. If n is even, go to step 1; otherwise, go to step 2.
4. Output n.