Use the pumping lemma for regular languages or the closure properties of regular languages to show that these languages arc not regular. a) L_1 = {0^i 1^j2^k|i, j, k>=0 and either i = j or i = k} b) L_2 = [omega elementof {0, 1, 2}*| the number of 0s in w is the same as the number of 2s in w} c) L_3 = {0^nl^m|n lessthanorequalto m} d) L_4 = (omega elementof {0, 1}*| omega has more 1 s than 0s} e) L_5 = [0^n^2|n greaterthanorequalto 0} Proofs should be precise, concise and correct for full credit