Eulerian and Hamiltonian Graphs · Medium problem

The Petersen graph is $3$-regular (every vertex has degree $3$). What is the fewest edges that must be added to the Petersen graph (keeping it simple, without multi-edges) so that the resulting graph has an Euler circuit?