For any regular language L$,$ prove that L$=\{$xay $|$ xy in L$,$ a in

$\backslash$Sigma $,$ x$,$ y in $\backslash$Sigma $\}$ is regular, i$.$e$.$ the set of all strings from which deleting exactly one

character gives a string from L$.$l For example, if L were binary palindromes $($words that

are the same when reversed$),$ some words in L$$ would include $10010,100,1110001$deleting the red character from eachstring produces a palindrom