Consider the following graph. a b d g (a) Without adding new vertices, add a single edge to the graph so that the new graph will have an Euler path. Which vertices does your new edge connect? O d and h O i and d O b and e O h and f O a and h X (b) In addition to the edge from part (a), add a second edge (using the existing vertices) so that the resulting graph will have an Euler circuit. Which vertices does your second new edge connect? O b and i O g and b O c and h O g and f O d and c X