The adjacenty matrix A for a graph and A2 and A are: 0 1 0 1 0 2 1 2 1 2 101 1 1 1 4 1 3 2 A = 0 1 01 0 ,A2 2 1 2 1 2 1 1 101 1 3 1 4 1 0101 0 2 1 2 1 2 2 7 2 7 2\\ 7 6 7 7 7 43 2 7 2 7 2 7 7 7 6 7 2 7 2 7 2 Which of the following statements is NOT correct? There are exactly 2 walks of length 3 from vertex 1 to vertex 5 There are exactly 4 walks of length at most 2 from vertex 3 to vertex 5 There are exactly 2 walks of length 2 from vertex 3 to vertex 5 There are exactly 2 walks of length 3 from vertex 3 to vertex 5