Exercise 3 (4 points). A walk of length n in a graph G is an alternating sequence vo, e1, v,Vn of vertices and edges of G such that for all i e 1,...,n], e, is an edge relating v,-1 to vi. Show that for any finite graph G and walk vo, ei, vi ,Un n G, there exists a walk from vo to vn with no repeated edges. (Hint: Use complete (strong) induction on the number of edges in the walk.)