Please solove 3

3, (10points) Recall, for a language L its complement is the set of strings over not in L, denoted - as L = {w LIC *. Let A be the language above and Let C = {w e {0, 1}* : w has even length} Draw the state diagrams of the DFA of the following language. For full credit, your DFA should have no more than 10 states. Hint: use the construction from the book proving the union of two regular languages is regular. (a) AuC. (b) Anc 4. (10 points) We first review some definitions . The concatenation of two languages L1, La over is L1 o L2-{XJZ2 : Xi Li). . Lastly, the language L*-{xiT2 Xk : Xi L, k 0} Let A and B be the languages above. Draw the NFA state diagrams of the following languages: (a) Ao B (b) (4)" olf Created by Paint X