No ABs in this string

Probability Level 2

A string of $n$ characters is made from the characters $\text{A}$ , $\text{B}$ , and $\text{C}$ .

Let $G_n$ be the number of such strings of $n$ characters which contain no instance of $\text{AB}$ (in that order).

Write a recurrence relation for $G_n$ .