Eulerian and Hamiltonian Graphs · Medium problem

The wheel graph $W_6$ has a hub $H$ joined to all $6$ vertices of a $6$-cycle rim, plus the $6$ rim edges ($7$ vertices total). Does $W_6$ have an Euler trail (a walk using every edge exactly once, possibly not returning to its start)?