Consider the following automaton: a$)$ Give an example of a string of length $6$ containing $01$ that is accepted by the following automaton. $[2$ marks$]$ b$)$ Give an example of a string of length $5$ that is rejected by the following automaton. $[2$ marks$]$ c$)$ Describe the language of this automaton in terms of a Regular Expression. $[3$ marks$]$ 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.