(a) Draw a picture of a connected undirected graph having degree sequence 2, 2, 3, 3, 4, or explain
why no such graph exists.
(b) Does the graph you drew in part (a) have (Give reasons for each Yes/No answer)
(i) an Euler circuit?
(i) an Euler path?
(ii) a Hamiltonian circuit?
