The language L2={aib2ii0} is not a regular language. Using the Pumping Lemma, for any string s in L2 of length n, s can be divided into five pieces xyz such that |xy|<=n, |y|>0, and for any i, xyiz is in L2. However, there is no possible division for the string aaabbbbbb that satisfies the conditions of the Pumping Lemma.