In an automata or formal-language problem, which option best represents NFA?

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