In determinstic finite automata is there any possibility that every state is final state?

Question

Is there any limit that final states should not more than some number(2,3,...) ?

Answer 1

If we have the regex a* we could express it as a state machine with one state with a loop. It's both the initial and final state. So yes, all states are final here.