AMC 8 1994 Problem 24

A $2$ by $2$ square is divided into four $1$ by $1$ squares. Each of the small squares is to be painted either green or red. In how many different ways can the painting be accomplished so that no green square shares its top or right side with any red square? There may be as few as zero or as many as four small green squares. $\text{(A)}\ 4 \text{(B)}\ 6 \text{(C)}\ 7 \text{(D)}\ 8 \text{(E)}\ 16$