Use the pumping lemma to prove language Lis not regular: La = {1"2"3" : n >0}