Following Languages Prove Regular Drawing Dfa Nfa Prove Regular Using Pumping Lemma 1 9 M Q37119259

For each of the following languages, prove that it is regular (by drawing a DFA or an NFA) or prove that it is not regular (by using the pumping lemma). (a) 1. [9 marks] ii. L wE 0,1)w does not contain the substring 101] iii. La = {www| w E {0, 1}*) Show transcribed image text For each of the following languages, prove that it is regular (by drawing a DFA or

OR

 

OR