Eulerian and Hamiltonian Graphs · Easy problem

The complete graph $K_5$ has vertices $0,1,2,3,4$ and an edge between every pair of distinct vertices. Does $K_5$ have an Euler circuit?