Question 9
Every unit square of a $n \times n$ board is colored either red or blue so that among all $2 \times 2$ squares on this board all possible colorings of $2 \times 2$ squares with these two colors are represented (colorings obtained from each other by rotation and reflection are considered different).
a) Find the least possible value of $n$.
b) For the least possible value of $n$ find the least possible number of red unit squares.
a) Find the least possible value of $n$.
b) For the least possible value of $n$ find the least possible number of red unit squares.