How should deterministic finite automata (DFAs) be constructed from non-deterministic finite automata (NFAs)?
a) By drawing their state diagram only
b) By using regular expressions
c) By showing the transition tables and state diagram
d) By guessing and checking different configurations