4. (Part A) Show how the pumping lemma for context-free languages applies for the following language over = {a,b} L = {w | w has an equal number of a's and b's}. (Part B) 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}