The Graph Below Has Two Odd-Degree Vertices, So No Euler

Multiple Choice

The graph below has two odd-degree vertices, so no Euler circuit exists. Suppose we would like to find a route that backtracks as little as possible. What duplicate edge could we create to help us find this route?

A) between A and B
B) between B and C
C) between D and E
D) between E and F