1. Give DFA's accepting the following languages over the alphabet {0, 11: (a) The set of all strings that contain 011 or 100 (or both) as a substring (b) The set of all strings that contain both 011 and 100 as substrings. (c) The set of all strings such that every three consecutive symbols contain at least two ls