Eulerian and Hamiltonian Graphs · Medium problem

The complete graph $K_4$ on vertices $A,B,C,D$ has all $6$ edges. What is the minimum number of edges that must be deleted so that the remaining graph (still spanning all $4$ vertices) has an Euler circuit?