$(1$ point$)$

Consider the graph given above. The graph doesn't have an Euler circuit. However, if we added one more $($specific$)$ edge to

the graph, then it would have an Euler circuit. Which edge should we add so that the resulting graph has an Euler circuit?

$($Do not repeat an existing edge.$)$

Now give an Euler circuit through the graph with this new edge by listing the vertices in the order visited.