Consider a DFA with 1000000000000000000000000000 states, over the input alphabet consisting of all Greek alphabet letters. What can we say about it?
a.It is not possible that it accepts the empty set.
b.It is not possible that it accepts only empty string.
c.It is not possible that it accepts strings of length 1 only.
d.It is possible that it accepts all strings over the input alphabet.