Make a DFA for the following languages: a) The set of all strings that have one a, one b, and one c.SIGMA={a,b,c} b) The set of all strings that begin with abb and end with baa. SIGMA={a,b} c) The set of all strings with and where the string represents a binary number that is evenly divisible by 5. d) The set of all strings where there are exactly three runs of three a?s. SIGMA={a.b} e) The set of strings where the first two characters are the same as the last two charactersSIGMA={a.b}. Examples of strings in the set: aabbabaaa, abbbbbab, bbb, aa, baaaaaaba Examples of strings not in the set: ab, aba, aabbbbb, abbbbbbbba, a, b,

Are there any languages where If yes, give an example. If no, prove it. Make a DFA for the following languages: The set of all strings that have one a, one b, and one c. The set of all strings that begin with bab and end with aba. The set of all strings with summation = {0, 1} and where the string represents a binary number that is evenly divisible by 5. The set of all strings where there are exactly two runs of three a's. The set of strings where the first two characters are the same as the last two characters. Examples of strings in the set: aabbabaaa, abbbbbab, bbb, aa, baaaaaaba, ab Examples of strings not in the set: aba, aabbbbb, abbbbbbbba, a, b, Prove that if L_1 and L_2 are regular then: L_1 - L_2 is regular. The everyother(L_1) is regular. The everyother of a string is defined as every other character starting with the first character. For example the everyother of fernandez is fradz. The everyother of the language L is {everyother(w)|w is a member of L}. L_1 - { lambda) Convert the following NFA's to DFA's. (using the method shown in class and show your work) Describe in English the language associate with