Explain to me how can you determines the number of walk just base on G^2 and G^3 only.

The drawing below shows G2 and G3 for a graph G 2 2 4 4 Use the information provided in G2 and G3 to answer the following questions about G (a) Is there a walk of length 3 from vertex 4 to vertex 5 in G? (b) Is there any circuit of length 2 in G? (c) Is there any circuit of length 3 in G? d) Is there a walk of length 4 from vertex 2 to vertex 1 in G? (e) Is there a walk of length 5 from vertex 2 to vertex 3 in G