Write a regular expression that defines the language over {a,b,c}, consisting of all words that begin and end in a double c, contain at least one letter between the starting double c and the ending double c, where bs must occur in groups of 2 or more, and each group of bs must be preceded by an a.