Which recurrence relation models the number of ways to color the vertices of a path graph with $n$ vertices using $k$ colors such that no two adjacent vertices have the same color?