Below is a graph. Determine whether it is Eulerian or not. You can drag the points around if that is helpful. B A E If it is Eulerian, give an Eulerian circuit as a list of vertices (for example [A,B,C,D,E,A]), and if it is not Eulerian, give an empty list (i.e. []). Eulerian circuit: A simple graph has 33 edges, and each vertex has the same degree, d. Find all possible values for d, and the corresponding number of nodes n. Your working should include a description of the graph. Give each pair of (d, n) as an ordered pair on its own line. (d, n)