An Euler graph G is a graph that has a closed Euler

An Euler graph G is a graph that has a closed Euler trail. An Euler trail is a trail that contains every edge of G exactly once. Which subgraph with four edges of the graph in Example 1,is an Euler graph?

PROBLEM SET 23.3: