Question: Each of (a)-(c) describes a graph. In each case answer yes, no, or not necessarily to this question: Does the graph have an Euler circuit? Justify your answers.
a. G is a connected graph with five vertices of degrees 2, 2, 3, 3, and 4.
b. G is a connected graph with five vertices of degrees 2, 2, 4, 4, and 6.
c. G is a graph with five vertices of degrees 2, 2, 4, 4, and 6.