A walk of length n in a graph G is an alternating sequence v0; e1; v1 : : : ; vn of vertices and edges of G such that for all i is an element or 1; : : : ; n, ei is an edge relating vi-1 to vi. Show that for any finite graph G and walk v0; e1; v1 : : : ; vn in G, there exists a walk from v0 to vn with no repeated edges. (Hint: Use complete (strong) induction on the number of edges in the walk.) PLEASE USE STRONG INDUCTION.