Here's the question:
Let Σ = {a, b, c}. Write a regular expression for the set of all strings in Σ* (the * represents a Kleene star) 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.