Eulerian and Hamiltonian Graphs · Easy problem

In the complete bipartite graph $K_{2,5}$ (two vertices on one side, five on the other, every cross edge present, no edge within a side), every cycle must alternate sides. How many edges does the longest cycle in $K_{2,5}$ have?