No collaboration is permitted on the quizzes. Calculators are not permitted. Please ring your section below:

Question:
Version A:
Consider the following graph with 11 vertices:

(Version B: add an edge (a,c). Version C: add an edge (k,l).)

1. Does this graph have an Euler path? (Just answer “Yes” or “No”, with justification. You do not need to draw the path, if it exists.)
2. Find a Hamiltonian cycle in the graph.