please answer parts b and c

(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 (b) Which one of the following statements below describes the set of strings accepted by FSM 1? 1. The FSM accepts a string x if and only if x contains the pattern " 01 " somewhere in the string. 2. The FSM accepts a string x if and only if x starts with a 1 and ends with a 0 . 3. The FSM accepts a string x if and only if x is all 0 's or all 1 's (i.e. x only contains one type of character). 4. The FSM accepts a string x if and only if there are at least three consecutive 0 's somewhere in x. 5. The FSM accepts a string x if and only if x ends with "000". 6. The FSM accepts a string x if and only if x ends with "00". (c) Refer to the same set of statements in the previous question and indicate which statement describes the set of strings accepted by FSM 2