Question: The definition of an Euler path extends to directed graphs. Instead of just the degree of a node as the total number of arc ends, we must now keep track of arcs coming into a node and arcs leaving a node. The total number of arc ends coming into a node is its in-degree; the total number of arc ends leaving a node is its out-degree.
Determine whether this graph has an Euler path. If so, list the nodes in such a path.
