$6\mathrm{.}1\mathrm{.}3$: Identifying the set of strings accepted by an FSM$.$

help$\_$outline

$($a$)$

Give the final state of each FSM after each input string below. That is$,$ start in the start state, process the string, and indicate which state $($A$,$B$,$C$,$ or D$)$ the FSM is in at the end of the string. Then indicate whether or not the final state is an accepting state.

$100011$

$0000$

$0010$

$1100$