Q2) Let B = [S. 1. 4o. fF] be the deterministic finite automata (DFA) machine as depicted in Figure 1 1 Figure 7 0 List all the components of S. 1.4. F. (ii) Construct a transition table for the above machine. (ii) is the string 111010 accepted by the machine? (iv) Find the sequence of configurations and state if the string 01011101 is accepted by the machine