Please answer C.

Use the pumping lemma for regular languages or the closure properties of regular languages to show that these languages are not regular. L1 = {01 1/2kli, j, k >= 0 and either i = j or i = k} L2 = {w {0, i ,2) * l the number of 0s in w is the same as the number of 2s in w} a) b) n 1 m d) L4 = { w E {0, 1 } * I w has more ls than 0s)