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

A. a transition that resets the input tape B. a transition that consumes every remaining symbol C. a transition taken without consuming an input symbol D. a transition allowed only in DFAs