Write a method that emulates a general finite automaton. The input to this method should include:

• the number N of states q₀, ..., q_{N 1}; we assume that q₀ is the start state;
• the number M of symbols s₀, ... s_{M 1};
• an integer array state[n][m] that describes to what state the finite automaton moves if it was in the state q_n and sees the symbol s_m;
• a boolean array final[n] that tells us, for each state, whether this state is final or not.

This program needs to keep track of a current state. Initially, this location is 0.

Your program should emulate the work of the finite automaton step-by-step. Return the printout of the method, the printout of the program that you used to test this method, and the printout of the result of this testing. Feel free to use Java, C, C++, Fortran, or any programming language in which the code is understandable.