1. Show that if L is regular, then the language tail is also regular, where tail(L)-(v : xy E L for some x E *) 2. Use the pumping lemma to show that the following language is not regular: 3. Use the pumping lemma to show that the following language is not regular: 4. Use the pumping lemma to show that the following language is not regular