assume that the vocabulary is {a, b, c}. give a regular expression that describes all sequences in which the number of a symbols is divisible by three