Let L be a language under any alphabet . Define the following language:

L(L) = { xz : x, z , xyz A for some y },

i.e., L(L) is the language that contains every strings that can be obtained by the removal of exactly one symbol from the word A.

Prove that the regular language class are closed under L operation.