Eulerian and Hamiltonian Graphs · Medium problem

A graph has a center vertex $0$ joined to four leaves $1,2,3,4$ (a star, $4$ edges), and nothing else. What is the minimum number of NEW edges that must be added (between any two of the $5$ vertices, including a repeat of an existing edge) so that the resulting graph has an Euler circuit?