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

A. a machine whose output depends only on final state B. a transducer whose output depends on current state and input symbol C. a grammar in Greibach normal form D. a language accepted by no machine