Use the pumping lemma for regular languages or the closure properties of regular languages to show that these languages are not regular. a) L! = {01 1J2KI i, j, k >= 0 and either i j or i = k} b) L2 = { W E 10, 1,2) * l the number of 0s in w is the same as the number of 2s in w}