Q. 24 Let PP be a regular language and QQ be a context-free language such that Q⊆PQ⊆P. (For example, let PP be the language represented by the regular expression p∗q∗p∗q∗ and QQ be {pnqn∣n∈N}){pnqn∣n∈N}). Then which of the following is ALWAYS regular?
Answer: (C)
Explanation:
