Please help with question 5

1. (10 points) DFA's: Design an DFA that recognizes the language L1 with the alphabet {0,1} (Draw the state diagram). L1 = {w {0, 1*/w contains 11 as a substring} 2. (10 points) DFA's: Design an DFA that recognizes the language L2 with the alphabet {2,3} (Draw the state diagram). L2 = {w E {2,3}*w ends with substring 23} 3. (10 points) NFA's: Design an NFA that recognizes the language L3 = L1 U L2 with the alphabet {0, 1, 2, 3} (Draw the state diagram). 4. (10 points) Regular Expressions: Give a regular expression for L3. 5. (10 points) Design a Context-free grammar for L3 (specify the 4-tuple and all of the rules. Need not be in Chomsky normal form)