let l be the language over {a, b, c, d} accepting all strings so that: 1. all c’s occur before the first b. 2. all d’s occur after the first b. 3. the last symbol of the string is d. 4. each a is immediately followed by an odd number of b’s. note that there are additional rules implicit in these rules. as you find them, obey them. by any constructive method you choose, demonstrate that l is regular.
