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

A. an instruction based on current state and tape symbol that writes, moves, and changes state B. a grammar parse tree C. a finite input alphabet with no states D. a SQL trigger only