a. Give a regular expression whose language is strings over {a, b} in which the number of as is divisible by 3.

b. Give a regular expression whose language is strings over {a, b, c} in which the total number of bs and cs sums to 3.

c. Give a regular expression whose language is strings over {a, b} in which every a is either immediately preceded or immediately followed by b.