Define R(L) = {sr | s L}. That is, R(L) is the language of all strings that are reverses of strings in L. Prove that R is the closure property of CFLs. (Hint: Assume there exists a CFG in CNF that generates L, and use it to mathematically define a new CFG that generates R(L)).