a$)$ Construct the deterministic finite automaton that recognizes all words NOT beginning with $001$

b$)$ Minimize the automaton in part a$)$

c$)$ Calculate the language of the automaton in part b$)$