Write a regular expression for the language L using alphabet $\{a,b,c\}$ where all strings in the language start with a $"$c$",$ followed by a single $"$b$",$ followed by any number of a$\text{'}$s$,$ ending in a $"$b$"$