1) Use the Pumping Lemma to prove that the following languages are nonregular: i) L={aibjaii,j>=0 } ii) L={aibjjaji,j>=0} iii) L={aaijjji,j>=1} iv) The language consisting of all words which can be broken into the same string repeated twice, e.g., abbabb or baabbbaabb v) (a+b)jai.