Using the Pumping Lemma, prove that the following languages are not regular: a) L3={0(k3)k0} i.e. strings of 0 of perfect cubes: L3={,0,00000000,} b) L4={wwww{0,1}} i.e. strings of 3 copies of the same string, such as 000,111,010101