Let L be a regular language. Define L$=\{$xay in $\backslash$Sigma $|$ xy in L$,$ a in $\backslash$Sigma $\}.$ We

take the strings in L$,$ and add exactly one symbol anywhere in the string for anywhere

it could be placed, even possibly at the beginning or end. Prove that if L is regular,

then so is L$$