a b 0.5 Graphs and Networks @ Make adjacency matrix for this graph G shown here. Find number of walks of length 8 from vertex a to vertex c. d (Tip: Don't compute all of A. Use your knowledge of matrix multiplication to do just the minimum amount of work you need to do to get this information.) a b 0.5 Graphs and Networks @ Make adjacency matrix for this graph G shown here. Find number of walks of length 8 from vertex a to vertex c. d (Tip: Don't compute all of A. Use your knowledge of matrix multiplication to do just the minimum amount of work you need to do to get this information.)