Using the pumping lemma to show that the language L = {anbmcm | n ≥ 1, m ≥ 1} is not regular:
a) True
b) False