Deterministic Finite Automaton (DFA) is defined as a 5 tuple: Q ==> a finite set of states ==> a finite set of input symbols (alphabet) 40 ==> a start state start state F ==> set of final states 8 ==> a transition function, which is a mapping accurately defined by which of the following: A: Qx- B: Qx -> Q B: Qx [ -> Subset of Q D: None of the above B C A