Consider an n by n grid. We want to colour its cells in two colours: some black, and some white. We will consider two colourings as the same if they can be obtained from each other by a rotation (not by a reflection). (a) If n = 2 the problem is small and can be solved by brute force. Draw all the distinct colourings.