Let $t_n$ be the number of ternary strings of length $n$ (using symbols '0', '1', '2') that do not contain the substring '00'. Find the recurrence relation for $t_n$ for $n \geq 2$.