Not all context free grammars define regular languages. However, the following two DO define regular languages. For each grammar below, (a) describe the corresponding language and (b) draw the corresponding finite state machine.
G1 -> A | B
A -> xA | z
B -> y | w
G2 -> CD
C -> nnC
D -> pp