Eulerian and Hamiltonian Graphs · Easy problem

The complete bipartite graph $K_{2,4}$ has two vertices on one side and four on the other, with an edge between every vertex on one side and every vertex on the other (no edges within a side). Does $K_{2,4}$ have an Euler circuit?