Which one is true for a DFA?

Which one is true for a DFA?

1. a) DFA can have ε-transitions
2. b) DFA accepts all context-free languages
3. c) DFA accepts regular languages
4. d) DFA can have multiple transitions for the same input from a state