Given an Eulerian graph (directed or undirected, your choice)

1. a write a recursive algorithm to produce the trace of the Eulerian path in the graph. The trace is a not necessarily simple cycle of nodes that will be visited such that we visit every edge in the graph exactly once, and end in the same node from which we started.

2. b Write your algorithm as an iterative algorithm. Analyse the complexity of this version. There exists a O(|E|) iterative implementation of the recursion.