For each of the following languages, either show that the language is regular by providing a finite automaton, or prove that the language is not regular using the pumping lemma.

L2 = {x4y | x, y {0,1} and the number of 0s in x is the same as the number of 1s in y}