ans is B an euler graph is a graph having an euler circuit
An Eulerian cycle,[3] Eulerian circuit or Euler tour in an undirected graph is a cycle that uses each edge exactly once. If such a cycle exists, the graph is called Eulerian orunicursal. following graph is euler with even degree of every vertex