please answer questions individually

( ) (10 points) Let L1 be the language L1={aibpi0andpisaprime}. (a) Prove that the language L2=bL1 satisfies the conditions of the Pumping Lemma. I.e. show that there exists a qN such that for every word wL2 with wq we can write w=xyz such that xyq,y>0, and for every i0,xyizL2. (b) (10 points) Prove that the language L2 is not regular