Prove that the class of context-free languages is closed under reverse, i.e., prove that if L is context-free then L^R is context-free. For full credit, you must set up the proof so that all variables you use have been defined, then clearly and correctly give the construction, and then informally justify why the construction works