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