2. (40 marks) Give a regular expression for each of the following languages over the alphabet 0,1j: (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. Transform the regular expressions obtained for 2c into an equivalent -NFA, and afterwards in a DFA, using the algorithms learned in class (or the ones in your textbook)(10 marks). Minimize the resulting DFAs(10 marks)