What is the purpose of the pumping lemma in case of regular language? Use the pumping lemma to show that {012n| n is the multiple of your first name length} is not regular. a) Give a leftmost derivation for the string. b) Give a rightmost derivation for the string. c) Give a parse tree for the string. S + SS SS a with string + aaa.