For the following set of strings A over alphabet = {a,b,c}, demonstrate that A is regular. A= {w * |(#a(w)) mod 3=0} mod is the modulo operation. That is, the number of a's in string w (ie. #a(w)) when divided by 3 would yield a remainder of 0