3. 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 (optimally in 10 words or fewer) and (b) draw the corresponding finite state machine. G1->A | B B->ylw G2->CD D->pp 3. Give state diagrams of DFAs recognizing the following languages. In all parts, (0,1). a. The empty set b. (w I the digits interpreted in binary are evaluated to 8 or higher) c. (w I w has an even number of digits) d. (w | the digits together sum to a number less than 3 )