![1. (a) For each of the following languages, prove that it is regular (by drawing a DFA [12 marks] or an NFA) or prove that it](https://media.cheggcdn.com/media%2F28e%2F28ee3512-e014-4fb2-9164-ae07ab4b25a9%2Fimage.png)
1. (a) For each of the following languages, prove that it is regular (by drawing a DFA [12 marks] or an NFA) or prove that it is not regular (by using the pumping lemma) i. L1012> 0) ii. la = {tu E(0,1)*lu, contains the substring 0110) iii. L,-{l”삐 n 1, u’ E {0, 1)’, and I ul n} Show transcribed image text 1. (a) For each of the following languages, prove that
OR
OR