L1 = {w {0, 1} | w contains 11 as a substring}

L2 = {w {2, 3} | w ends with substring 23}

anguage L3 = L1 L2

3. (10 points) NFA's: Design an NFA that recognizes the language L3 = Lj U L2 with the alphabet {0,1,2,3} (Draw the state diagram). 4. (10 points) Regular Expressions: Give a regular expression for L3. 3. (10 points) NFA's: Design an NFA that recognizes the language L3 = Lj U L2 with the alphabet {0,1,2,3} (Draw the state diagram). 4. (10 points) Regular Expressions: Give a regular expression for L3