18. For the multigraph below, identify: (a) the order of the graph; (b) the degree of each vertex; and (c) that the sum of the degrees of the vertices is twice the number of edges.
Determine if the following graph is complete. Is it traversable? Is it Eulerian? If it is traversable, find an Eulerian trail. If it is Eulerian, find a circuit.