Build transition diagram for NFA that accpt the following language:

Build transition diagrams for nondeterministic finite automata that accept the following lan guages. Be sure to use the power of nondeterminism to simplify these automata. (a) (u E {0,1}": w = 010 or 1 is even) (b) wE [0, 1)* w contains the pattern 0100 ) (c) {w {0,1}": w corresponds to the binary encoding of a positive integer that is divisible by 16)