Concatenate languages and turn it into an e-nfa, nfa, and dfa
a) draw an ε-­nfa (an epsilon nfa) for the language l3 where l3 is the concatenation of l1 and l2. where:
l1 = all strings over σ= {0,1} that end in…001 and l2 = all strings over σ= {0,1} that contain 010 anywhere in the , middle or end)
b) take the ε-­nfa (epsilon nfa) from part a and turn it into a regular nfa.
c) take the regular nfa from part b and turn it into a dfa.