Can anyone please help me with this question? I am having a little trouble with it so i would appreciate any help.

Forn less then 1, let w(n) be the number of words of length n in the alphabet {a, b, c, d, e} with no adjacent a’s. Determine a recursive

relation for w(n), with appropriate initial values. Your recursion MUST

BE accompanied by a combinatorial proof of the result, however, you DO

NOT NEED to find a closed form for w(n).

Thansk and I appreciate it.