Give DFA's accepting the following languages over the alphabet {0; 1}:
(a) The set of all strings with 101 as a substring. Prove the correctness of your DFA using state invariants.
(b) The set of all strings with 11 as a substring. Prove that your DFA has the minimal number of states using techniques shown in class.
(c) The set of strings ending in 110. (No proofs required here)