d$)$ Re$-$draw this FSA with at most $4$ states. The new FSA should accept all strings that this

FSA accepts. In addition, it should reject all strings that this FSA rejects. $[2$ marks$]$

e$)$ Draw a FSA which accepts all binary strings which start with $0,$ the length of the string is

even but the number of $1\text{'}$s in the string is odd. For example, $0111,01$ and $000111$ should be

accepted while $111$ and $0011$ should not. $[3$ marks$]$