i. Given a deterministic finite automata (DFA) as in Figure 2.
a) List all the components of S, I, qo, F.
b) Find the sequence of configurations and state if the string 0011101100 is accepted by the DFA.
ii. Construct a DFA that accepts the set of all bit strings that contain three consecutive 1s.