Write a regular expression for each of the following languages:

(a) Given an alphabet = {0, 1}, L is the set of all strings of alternating pairs of 0s and pairs of 1s.

(b) Given an alphabet = {0, 1}, L is the set of all strings of 0s and 1s that contain an even number of 0s or an even number of 1s.

(c) Given an alphabet = {a, b, c, d}, L is the set of all strings in which the letters appear in strictly ascending lexicographical order. Strictly ascending means that the same letter cant appear twice.