1. Write regular expressions to capture the following regular languages:

(a) The set of binary strings which have a 1 in every even position. (Note: odd positions may be either 0 or 1.)

(b) The set of binary strings that do not contain 011 as a substring.

(c) Comments in Pascal. These are delimited by (* and *) or by { and }, and can contain anything in between; they are NOT allowed to nest, however.