Question 3 (Walks and Paths, 30 points). In a graph G we say that there is a walk from vertex u to another vertex w if there is a sequence of vertices u = vo, V1, ..., Un = w so that (Vi, Vi+1) is an edge of G for each 0