is a graph with adjacenty matrix A. We know the following about the matrix A: . The 2nd row of A is: 0 1011 The 2nd row of A2 is: 03013 . The 2nd row of A is: 02013 How many routes are there that connect vertex 2 to vertex 5 of length exactly 3? Your