You are given a connected directed graph G = (V,E). Design a O(n+m)-time algorithm that computes a directed path that starts from a vertex v 2 G, visit each edge exactly once (according to its direction) and ends in v. If such path cannot be found, your algorithm should determine that.