70. Draw a graph with exactly two vertices of valence 3 and a minimal but positive number of 4-valent vertices, which can be eulerized by adding one edge.