Show the moves made using the DFSA for identifiers given (see below) in accepting the following: A.a B.a2 C.a2i D.abc A move consist of traversing the arc exiting the state that corresponds to the leftmost input symbol, thereby consuming it. If no move is defined for the state input symbol pair, the automation halts in error, rejecting input.
