0 0 0 0 1 0 0 0 1 Consider a graph whose adjacenty matrix is A = 0 0 O 1 1 Notice 0 0 1 0 0 1 0 10 0 0 1 2 1 1 C 0 2 1 1 0 2 0 1 1 0 C that A2 0 1 2 1 1| and A = 1 1 2 3 4 .How 0 1 1 2 1 1 1 3 2 4 1 01 13 0 4 4 4 2 many walks (routes) of length at most 3 are there between vertex (node) 2 and vertex (node) 3? 2 1