(this is the one i need) 5: Show that the family of context-free languages is closed under reversal.

Im not sure, but it might refer to these 4

For problems 1-4, if L is a CFL then give a context-free grammar or NDPA that recognizes the language; otherwise, use the pumping lemma or closure properties to prove Lis not a CFL