Given three regular languages L1,L2 and L3. Prove that L1(L2L3) is a regular language. Note: For this, you must argue that there is a finite automaton M with L(M)=L1(L2L3) Given the following DFA M=(QD,,D,qD,FD) Following the construction presented in class that proves that for every DFA there exists an equivalent NFA, describe NFA AN=(QN,,N,qN,FN) with L(AN)=L(M) by giving QN,N, qN and FN