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

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

a)NFAs: Design an NFA that recognizes the language L3 = L1 L2 with the alphabet {0, 1, 2, 3} (Draw the state diagram).

b)Design a Context-free grammar for L3 (specify the 4-tuple and all of the rules. Need not be in Chomsky normal form)