Automata:

One of the three languages below is regular and the other two are non-regular. one of the other two languages is context-free. At least 2. wlw e 0,1) and the difference between the number of Os in the string and the number of l's in the string is an even integer. ) 3. w w e (0,1)' and there is either one more 0 than 1, or one more 1 than 0.) A. Identify the regular language and prove it is regular. B. Select a different language and prove it is context-free C. Select the third language and prove it is not regular