Please explain

(a) A k-polyomino is a geometric shape composed of exactly k squares of unit size such that at least one edge of every square touches some edge of any other square in the shape. A 1-polyomino or a monomino is simply the unit square, a 2-polyomino or domino are two unit squares adjoined by an edge (it literally is a physical domino), and a 4-polyomino or tetromino are the figures from the puzzle game Tetris. We say that a set of k-polynominos are one-sided if all of its members are distinct under rotations. For example, the largest possible set of one-sided tetrominos are: Because any other tetromino you can imagine is a rotation of one in this set. Draw the largest possible sets of one-sided 3- (triominos) and 5-polyominos (pentominos). (b) We say a set of k-polyominos are free if all of its members are distinct under rotation and reflection (e.g. flipping it over). The largest possible set of free tetrominos are: Note how the tetrominos are members of the one-sided set (thus are distinct under rotation) and the two "L" and "S" tetrominos in the one-sided set are reflections of each other. What is the size of the largest set of one-sided and free 6-polyominos (hexominos)? You could carefully try to enumerate them, or search for a pattern in the number of one- sided and free k-polyominos there are for each k6