For any regular language L$,$ prove that the language L$1=\{$axb $|$

x in L$,$ a$,$ b in $\backslash$Sigma $\},$ i$.$e$.$ the set of all strings that contain a string from L as a substring,

is also regular.