Languages are proved to be regular or non regular using pumping lemma? (A) True (B) False (C) NA (D) NAâ–ºCorrect Option Correct Option is: A