Find a recurrence relation for the number of ternary strings of length ݊ that do not contain two consecutive 0s and two consecutive 1s.
Find a recurrence relation for the number of ternary strings of length n that do not contain two consecutive 0s or two consecutive 1s.