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 0's and ls, such that no prefix has two more Os than ls, nor two more ls than 0's. For example the string 100101 belongs to the set, while the string 100011 does not