1. Write regular expressions for each of the following sets. (a) The set of binary strings where every block of three consecutive symbols in the string contains at least two l's. (b) The set of binary strings with equal number of O's and ls, such that no prefix has two more O's than ls, nor two more ls than O's. For example the string 100101 belongs to the set, while the string 100011 does not. 2. A systematic way of obtaining regular expression for a language is to design a DFA for it and convert the DFA to a regular expression using the standard procedure. For the language in 1(b), design a DFA that accepts it and convert the DFA to a regular expression. Give the intermediate steps. 2. A systematic way of obtaining regular expression for a language is to design a DFA for it and convert the DFA to a regular expression using the standard procedure. For the language in 1(b), design a DFA that accepts it and convert the DFA to a regular expression. Give the intermediate steps. 1. Write regular expressions for each of the following sets. (a) The set of binary strings where every block of three consecutive symbols in the string contains at least two l's. (b) The set of binary strings with equal number of O's and ls, such that no prefix has two more O's than ls, nor two more ls than O's. For example the string 100101 belongs to the set, while the string 100011 does not. 2. A systematic way of obtaining regular expression for a language is to design a DFA for it and convert the DFA to a regular expression using the standard procedure. For the language in 1(b), design a DFA that accepts it and convert the DFA to a regular expression. Give the intermediate steps. 2. A systematic way of obtaining regular expression for a language is to design a DFA for it and convert the DFA to a regular expression using the standard procedure. For the language in 1(b), design a DFA that accepts it and convert the DFA to a regular expression. Give the intermediate steps