please tell me how to make the picture by LaTeX via

5) Webber Chap. 3 Exercise 2 The DFA constructed for the example in Section 3.2 accepts the language of strings over the alphabet {0, 1} that start and end with a 0. It is not, however, the smallest DFA to do so. Draw a DFA for the same language, using as few states as possible