Consider an output-producing, deterministic finite state automaton (DFA) of the kind indicated in the figure below, in which it is assumed that every state is a final state.
Assume that the input is at least four bits long. Which of the following is(are) true?
I. The last bit of the output depends on the start state.
II. If the input ends with "1100", then the output must end with "1".
III. The output cannot end with "1" unless the input ends with "1100".
(A) I only
(B) II only
(C) I and II only
(D) II and III only