Give a regular expression for each of the following languages. a. The set of binary strings not containing consecutive 1's.
b. The set of binary strings containing exactly one instance of 11 somewhere inside.
c. The set of binary strings with at most one pair of consecutive 1's -- i. e, if 11 is present, it can occur exactly once.
d. The set of binary strings containing at least two zeros somewhere.
e. The set of binary strings containing at least two consecutive zeros and ends with 1.