A ternary string is a sequence of digits where each digit is either 0, 1, 2. Count the number of ternary strings of length n whose first 4 digits are all the same for n > 4. Count the number of ternary strings of length n containing exactly k 0 digits. Count the number of ternary strings of length n whose longest all zero prefix is of even length.