3. For each of the following language Li, give a formal definition OR a state diagram of a DFA Mi recognizing such language using product construction (=0,1) (*: optional): (a) Lc={ww contains an even number of 1 's or exactly two 0 's } (c) Le={ww contains an even number of 0 's and the number of 1's is not a multiple of 3}