Recursion, Catalan Numbers & Generating Functions · Medium problem

How many strings of length $5$ over the alphabet $\{a,b,c\}$ have no two adjacent letters equal?