1) Given a language b^n a^2n b^n. How many different ways are there to choose the substring y when applying the pumping lemma?

2) Give an example language that is a non-regular language but also satisfies the pumping lemma. You may just write down the name of the language.

Given a language b" aan on wheren > 1. How many different ways are there to choose the substring y when applying the pumping lemma? Give an example language that is a non-regular language but also satisfies the pumping lemma. You may just write down the name of the language