There are TWO QUESTIONS. Please don't give me just one answer. I received so many incomplete answers recently which is really frustrating. Please don't waste both you and my time. If you don't want answer all, just leave it. I don't want to waste my post questions because I paid for it. And also if you still give me incomplete answer, I would give you thumb down. Thank you.

4. Given two DFAs, Mi-(L, , si, F) and M2-(Qs, , 2, s2.F2). Give a DFA that accepts all strings that are in either L(Mi or L(M2), but not both. 5. Show that the following language is regular: .there is a way to insert the substring 011 (once) into w w E [0, 1) so that the result is a multiple of 3 in binary Example. The string w = 1011 should be accepted since 1010111 bin-87dec , a multiple of 3. The string w - 1000 should not be accepted since none of the following are multiples of 3 0111000, 1011000, 1001100, 1000110, 1000011