Use the pumping lemma to show that the language L = {a^p b^q: p + q is a prime number} is not regular. 6. Let Z = {0,1, + =}. Use the pumping lemma to show that the language L = {x=y+z :x,y,z are binary integers, and x is the sum of y and z} is not regular. For example, the string 1001=10+111 is in L