what is a common pitfall in applying the Pumping lemma of regular languages? C a.Trying to show a certain language in question is regular. b. Starting with a sufficiently long string NOT in the language in question. c. making an incorrect decomposition of a chosen sufficiently long string into three required substrings. d.all of above. C C e none of above