Find the number of ways to color the edges of a regular hexagon with $k=3$ colors such that no two adjacent edges have the same color, considering rotational symmetry. This is an application of Burnside's Lemma.