Deterministic Finite Automata (DFA) Write down the transition function for the following DFA: Start Nondeterministic Automata (NFA) 2. Write down the transition function for the following NFA: Start 0 1 2 3. Construct a Mealy machine that accepts an input string w and output z = 1 if it detects the sequence 010 as its input. Construct state transition table. Example: W = 000110011010110001011 Z = 000000000000100000010