Minimal DFA contains 4 states only. the following figure shows minimal DFA for a given regular expression:
only four state is sufficient
Dknights Given DFA accepts $\epsilon$ because initial state in the final state
abhinowKatore above finite automata is not DFA, not even minimal.