could you help solve this question? thank you

7. (5 points) Let G be a graph. A cycle of G that contains all the vertices in G is called a Hamiltonian cycle. Not all graphs have a Hamiltonian cycle. (a) Find a Hamiltonian cycle in the following graph: 4 9 1 3 7 5 2 8 (b) Show that if n > 5, then Cn has a Hamiltonian cycle