Suppose that G is a simple graph with vertices V1, V2, V3, V4, V5, V6. Which of the following conditions guarantee that there is at least one walk of length 500 from Vi to V2 in G? (Select all that do.) V1 V2 is an edge of G there is a walk of length 5 from Vi to V2 in G G has a closed Euler trail there is a walk of length 12 from Vi to V2 in G there is a walk of length 4 from Vi to V2 in G O G is connected