Eulerian and Hamiltonian Graphs · Medium problem

In the complete bipartite graph $K_{4,5}$ (sides of size $4$ and $5$), a Hamiltonian cycle is impossible (the sides are unequal), but a Hamiltonian PATH that visits every one of the $9$ vertices is possible, since the side sizes differ by only $1$. How many edges does such a path use?