(a) Draw a graph G such that there exists a closed walk of even length in G, but there is no cycle of even length in G.

(b) Prove that if there exists a closed walk of odd length in G, then there is a cycle of odd length in G.

(Note: You cannot use the fact that a non-bipartite graph must contain an odd cycle, since this is not proved in class yet.)