Let t_n be the strings of length n from the alphabet A = {x,y,z}such that the substring xx does not occur. Write out all the strings of lengths 1, 2 and 3 satisfying the condition, thereby nding t₁,t₂ and t₃. Find a recurrence for the t₁,t₂,....