Question of the Day 19-01-2019

Question of the Day
GATE 2011   CS   Question No. 24

Let P be a regular language and Q be a context-free language such that Q P. (For example, let P be the language represented by the regular expression p* q* and Q be { pn qn | n $\mathbb{N}$}). Then which of the following is ALWAYS regular?