G is a graph with adjacenty matrix A. We know the following about the matrix A: The 2nd row of A is: 01011 . The 2nd row of A- is: 03012 . The 2nd row of A is: 01010 How many routes are there that connect vertex 2 to vertex 5 of length at most 3? Your