1. Draw a DFA for each of the following (here, >= {0,1}): a. Set of all strings with at most one consecutive pair of 1's. b. Set of all strings that have an odd number of 1's and any number of O's. C. For = {a, b, c}, all strings with aab as a substring. d. For = {a, b}, all strings with aababb as a substring.