![1. (a) For each of the following languages, prove that it is regular (by drawing a DFA [9 marks] or an NFA) or prove that it](https://media.cheggcdn.com/media%2Fccd%2Fccdfad93-149a-4d95-a20a-27a35a46c283%2Fimage.png)
1. (a) For each of the following languages, prove that it is regular (by drawing a DFA [9 marks] or an NFA) or prove that it is not regular (by using the pumping lemma ii. L2 = {w E {0, 1)’| u, does not contain the substring 1000} 3 Show transcribed image text 1. (a) For each of the following languages, prove that it is regular (by drawing a DFA [9 marks]
OR
OR