3. (DFAs, NFAs, regular expressions and converting between them)

(c) (Rex to NFA) Use the procedure described in class (also in Sipser, Lemma 1.55) to convert (T(GGA)^* C) to an equivalent NFA. Simplify your NFA.

(d) (Description to rex) Give a regular expression that generates the following language: {w | w is a binary string and the number of 0s in w is divisible by 3}.