A minute observation will reveal that it accepts the language of the regular expression

The same language is accepted by the following simpler DFA as well.

Figure 2

It is a fact that, for any regular language L there is a unique minimal state DFA ( the uniqueness is up to isomorphism to be defined next ).