If an edge is removed from a connected graph and leaves behind a disconnected graph, such an edge is called a

2.a connected graph has 50

even vertices and two odd vertices.  
determine whether the graph has an euler path (but not an euler circuit), an euler circuit, or neither an euler path nor an euler circuit, and explain why.
the described graph has
an euler path (but not an euler circuit).
an euler circuit.
neither an euler path nor an euler circuit.
by euler's theorem, this is because the graph has
more than two even vertices.
exactly two odd vertices.
more even vertices than odd vertices.