I'm stuck with the following problem.. any ideas?

Find the number of walks of length n between two different, predetermined vertices in

K4 if n is:

i) 2

ii) 3

iii) 4

iv) 5

Define a recurrence relation for pn where pn is the number of walks of

length n between two different, predetermined vertices in K4.

I got that for n=2, there are two walks, for n=3 there are 5 paths, for n=4 there are 12....

Are these right? Can you help me get the recurrence relation?

Thanks!