Assume the alphabet is {a, b, c}. In the following questions, give a regular expression that represents the described set.

a) The set of all strings over {a, b, c} containg at least one b or at least one c.

b) The set of all strings over {a, b, c} that begins with bb and ends with cc.

c) The set of all strings over {a, b, c} that contains the substing ab or bc.

d) The set of all strings over {a, b, c} either starts and ends with a or starts and ends with c.

e) The set of all strings over {a, b, c} starts with at least one a and ends with at least one b immediately followed by zero or more number of c.