This question already has an answer here:
- How to prove that a language is not regular? 10 answers
In general, how can we go about proving that union of two languages as non regular. In this case, the individual languages can be proved as non regular using pumping lemma. How can we apply pumping lemma to union of two languages ?