2. Prove that the following language is not regular or provide a counterexample. L = {w {0,1}* | w has 2 times more 0's than 1's.}