1. Prove the language L is not regular, over the alphabet Σ =
{a, b}. L = { aib2i : i > 0}
2) Prove the language M is not regular, over the alphabet Σ =
{a, b}. M = { wwR : w is an element of Σ* i.e. w is any
string, and wR means the string w written in reverse}.
In other words, language M is even-length palindromes.