For a positive integer n, let sn count the number of ternary strings of length n that do not contain 102 as a substring. Note that s1 = 3, s2 = 9 and s3 = 26. Develop a recurrence relation for sn and use it to compute s4, s5 and s6