### Abstract Algebra: Burnside's Counting Theorem

Please see the attached file for full problem description. A bead is placed at each of the six vertices of a regular hexagon, and each bead is to be painted either red or blue, how many distinguishable patterns are there under equivalence relative to the group of rotations of the hexagon? Repeat Problem 8 with a regular h