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):

L = {w| w contains an even number of 0s and the number of 1s is not a multiple of 3}