let a and b be two vertices of g such that d(a, b) = 2 (that is, a and b are diagonal from each other rather than adjacent). find the number of walks of length 30 from a to b.
a) 0
b) 1
c) It depends on the specific adjacency matrix of G
d) 30