Please don't repost an existing solution to this in a different handwriting as that answer is incorrect. Thanks.

2. The reflection of a language L over an alphabet A is defined as: rev xE. Show that the class of context-free languages is not closed under reflection, i.e., find a context- free language such that its reflection is non-contex-free