Question # 15
Pumping Lemma is generally used for proving:
A given grammar is regular
A given grammar is not regular
If two given expressions are equivalent of not
A given problem can be solved by a Turing machine
A given problem cannot be solved by a Turing machine