What is meant by NFA in Theory of Automata and Formal Languages?

A. a deterministic automaton with no accepting states B. a finite automaton that may allow multiple possible moves for the same input C. a context-sensitive grammar D. a Turing machine with two tapes only