Theory of computing

2. (40 marks) Give DFAs accepting the following languages over the alphabet (0, 1): (a) the set of all strings consisting of alternating groups of 11 and 10 (11 and 10 alternates); (b) the set of all strings whose fifth symbol from the right end is a 1; (c) the set of strings that either begin, or end (or both) with 1110; (d) the set of strings such that the number of O's is divisible by five, and the number of 1's is divisible by six