A DFA (Deterministic Finite Automata) is defined by a quintuple (5-tuple) as (Q, Σ, δ, q0, F). Where δ =?

A. Finite set of states

B. Finite set of input symbols

C. A transition function that maps Q × Σ → Q

D. A start state q0 ∈ Q