3. Write a regular expression for the following language C over the alphabet {0, 1}. Provide a brief explanation of how your expression works. C = {w | the number of ls in w is divisible by two}