Select all the statements below which are true:

a) Let and M be a nfa. Let be a state of M. Then .

b) Let . Let M be a dfa and let be the corresponding transition graph. Let m be the number of vertices in . Then .

c) A language accepted by some dfa is a regular language and a language accepted by some nfa is a nonregular language.

d) Let and q₀ be the initial state of a dfa M. Then the transition graph of M has 3 outgoing edges in q₀.

e) There are languages accepted by dfa's which cannot be accepted by nfa's.

f) Transition function of a dfa can be defined using a transition table.

= {a, b, c}