Answered You can hire a professional tutor to get the answer.
QUESTION
Show how to construct, given arbitrary DFAs M 1 and M 2 with input alphabet , an NFA N (without empty transitions) such that L(N) = L(M 1 )L(M 2 ).
Show how to construct, given arbitrary DFAs M1 and M2 with input alphabet Σ, an NFA N (without empty transitions) such that L(N) = L(M1)L(M2).
