3. Give a nondeterministic finite automaton (NFA) to recognize the language:

L = ( w | w has a multiple of 3 0s or w has a multiple of 4 1s}

For example the following strings are in the language:

0111011111110 (3 0s) 0001111111111000 (6 0s) 11111111 (8 1s)

={0, 1}