# Question: let a b c write a regular expression...

###### Question details

Let Σ = {a, b, c}. Write a regular expression for the set of all strings in Σ*, such that the sum of the number of a’s and b’s in the string is at most two. Thus the string can have an a and a b but cannot have two a’s and a b, for example.

Using Kleene star, parentheses, and Union.