According to the above problem, the language defines as L={ an / n$\succeq$0}, for the single input alphabet a.
The above language generate 0 or more occurance of a such as {$\epsilon$,a,aa,aaa,aaaa,aaaaa............}
The RE for language is a* which means MDFA contain 1 state.
Now suppose when n is restricted to finite value such as n =5, for such type of language is as follow
L={an/0$\preceq$n$\preceq$5}
which accept all string of a length less than equal to 5 including $\epsilon$}
the last valid string for such type of language is "aaaaa", after that all strings are invalid goes to the dead state.
Likewise you can calculate the number of state for large number such as 1000,10000 etc.