a). Write regular expressions to denote each of the following languages, using the alphabet L.

1. Words with at most one pair of consecutive 0's and at most one pair of consecutive 1's.

2. Strings in which every pair of contiguous 0's appears before any pair of contiguous 1's. 3. Strings that do not contain 101 as a substring.