Which statement correctly describes NFA?

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