Let L The set of strings over the alphabet fa, b, c, d where every "c" is immediately preceded and also followed by a "b" (i.e. every "c" has the symbol "b" right next to it on both sides) So, for example These strings ARE in L These strings ARE NOT in L bcb abd bc cbbc abcd bccb cb bbcdbb abbbcbddabcb ddbcbcbcbcb aaaaabbbbcbbaa Problem 2a (6 points) Express L as a regular expression Put your answer to problem 2a in this box