1. Show that L={w{0,1}:w does not contain ' 001 as a substring } is regular in three ways. 2. Show that A={aibjcki=j or j=k where i,j,k0} is CF in two ways. 3. Show that if L is regular then so is LR 4. Show {www{a,b}} is a) not regular using Myhill - Nerode b) not context - free via pumping. 5. Convert NFA M=({1,2,3,4},{a,b},,1,{4}) where is given by to a DFA. Then minimize states in resulting one. 6. Consider L={w{0,1,2} such that w has all three symbols occurring in it }. Use the L on strings in {a,b,c} and Myhill-Nerode Theorem to show L is regular. Build DFA based on classes. Show it is indeed optimal as expected