G is a graph with adjacenty matrix A. We know the following about the matrix A . The 2nd row of A is: 0 0010 . The 2nd row of A2 is: 02001 . The 2nd row of A3 is: 01041 How many routes are there that connect vertex 2 to vertex 4 using at most 3 edges