Question 1.80

1. Discuss the difference between these two problems:
   1. Adding the minimum number of edges to a graph to make all its vertices even-valent
   2. Finding the best eulerization of a connected graph
2. In (i), must the graph that results from adding a minimum number of edges to make all the vertices even-valent have an Euler circuit?