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