Q. Pumping lemma is generally used for proving that (Solved)

1. Given grammar is regular

2. Given grammar is not regular

3. Whether two given regular expressions are equivalent or not