51. Draw a graph with exactly two odd-valent vertices, which requires exactly nine edges to be duplicated in order to find the best eulerization of the graph.