Read this problem for the definition of shift(l). Describe a proof that if any L is regular, then the language shift(L) is regular.

A. Automata theory
B. Formal language theory
C. Graph theory
D. Set theory