Graph Theory Discrete Math

Question

Given G = ( { a, b, c, d, e, f, g, h, i, j }, E ) and |E| = 45, how many different length-6 walks starting from a are there in G if G is undirected?

Answer: _ _ _ _ _

Answer 1

Apologies for the window covering my face, that's on Wyzant's end, not mine. Hope this helps!