Find a recurrence relation for the number of ternary strings of length n

a) Find a recurrence relation for the number of ternary strings of length n that contain two consecutive symbols that are the same.
b) What are the initial conditions?
c) How many ternary strings of length six contain consecutive symbols that are the same?