Given languages L, and Ly we define delete(L1, L2) to be the language {uw UVW L2, VE Li} to be the set of strings obtained by "deleting" a string of Ly from a string of L2. For example if L1 = {not} and L2 = {CS374isnotfun, not, notnotnot, blah} then delete(L1,L2) = {CS374isfun, e, notnot}. Prove that if L1, L2 are regular then delete(L1, L2) is also regular. In particular you should describe how to construct an NFA N =(Q, 2, 8,5,A) from two DFAs M = (Q1, 2, 81,$1,A1) and M2 = (Q2, 2, 82, 82,A2) such that L(N)= delete(L(M), L(M2)). You do not need to prove the correctness of your construction but you should explain the ideas behind the construction (see lab 3-5 solutions). Given languages L, and Ly we define delete(L1, L2) to be the language {uw UVW L2, VE Li} to be the set of strings obtained by "deleting" a string of Ly from a string of L2. For example if L1 = {not} and L2 = {CS374isnotfun, not, notnotnot, blah} then delete(L1,L2) = {CS374isfun, e, notnot}. Prove that if L1, L2 are regular then delete(L1, L2) is also regular. In particular you should describe how to construct an NFA N =(Q, 2, 8,5,A) from two DFAs M = (Q1, 2, 81,$1,A1) and M2 = (Q2, 2, 82, 82,A2) such that L(N)= delete(L(M), L(M2)). You do not need to prove the correctness of your construction but you should explain the ideas behind the construction (see lab 3-5 solutions)