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