If is a language, and is a symbol, then, the quotient of and, is the set of strings such that is in: is in. Suppose is regular, which of the following statements is true?

• A. L/a is always a regular language
• B. L/a is not a regular language
• C. Both of the mentioned
• D. None of the mentioned