If G = (V, E) is a directed graph or multigraph with no isolated vertices, prove that G has a directed Euler trail if and only if (i) G is connected; (ii) od(v) = id(v) for all but two vertices x, y in V; and (iii) od(x) = id(x) + 1, id(y) = od(y) + 1.