(3pts) Show how the pumping lemma for context-free languages applies for the following language over = {a,b,c} L = {a'bicki + j = k and i, j, k >0}