Let $c_n$ be the number of ways to color the vertices of a regular $n$-gon ($n \geq 3$) with 3 colors such that no two adjacent vertices have the same color. Which of the following recurrence relations describes $c_n$?