1. Given the following 2-way Deterministic Finite State Automaton (2DFSA), where state 1 is the initial state, and states 2 and 3 are final states. (b) Construct rebound tables and the equivalent 1DFSA partially only for consuming the string babb. 2DFSAab 1 2,R 3.R 2 4,L 2,R 34.R 2,L 4L.R 4.L 1. Given the following 2-way Deterministic Finite State Automaton (2DFSA), where state 1 is the initial state, and states 2 and 3 are final states. (b) Construct rebound tables and the equivalent 1DFSA partially only for consuming the string babb. 2DFSAab 1 2,R 3.R 2 4,L 2,R 34.R 2,L 4L.R 4.L