d$)$ Draw a FSA which accepts all binary strings which start with $0,$ the length of the string is even and it does not contain $001.$ For example, $0111,01$ should be accepted while $111$ and $0011$ should not.

b

Figure $1-$ FSA $($Finite State Automaton$)$ for Quiestion $6$

$[3$ marks$]$

Answer the question on paper