Use the pumping lemma for the following languages L to prove if it is a regular language or not: L = The set of strings, ♂ € {0, 1, 2}*, where the difference between the number of Os and the number of 1s is divisible by 2. L = The set of strings, ♂ € {0, 1, 2, 3}*, where the total number of Os and 1s is less than the total number of 2s and 3s. L = The set of strings, ♂ € {0, 1}*, where the number of Os is equal to 2x, x = the number of 1s.