5.4.13 Challenging REs. Construct an RE that describes each of the following sets of strings over the binary alphabet: a. b. c. d. All strings except 11 or 111 Strings with 1 in every odd-number bit position Strings with at least two Os and at most one 1 Strings with no two consecutive 1s