What is the primary difference between deterministic finite automata $($DFA$)$ and non$-$deterministic finite automata $($NFA$)?$

A$)$ DFAs use stacks, while NFAs use queues.

B$)$ DFAs have exactly one transition per state and input symbol, while NFAs can have multiple transitions.

C$)$ DFAs can accept more languages than NFAs.

D$)$ DFAs are more powerful than NFAs.