Suggested Exam Problem: From the adjacency matrix above, how many length \(8\) walks are there from vertices \(1\) to \(4\)?