Consider the language L below. (a) Is L a regular language? Yes, or No. (b) If L is a regular language, design the DFA (using a State Table) to accept the language L, with the minimum number of states. Assume , (c) Suppose the input is 101100. Is this input string in the language L? [Points: (a) 5, (b) 15, (c) 5]

= {0,1} L={w l w has both an even number of O's and an odd number of 1's}