Show that the family of context-free languages are closed under each of the following operations.

1. [10 Points] Show that the family of context-free languages are closed under each of the following operations. (a). Reversal Note: LR- [u: wE LJ, for any language L.) If and are alphabets, a homomorphism h is a function from to , that is h replaces a single symbol in to a string over . This definition can be extended naturally to strings, that is, if waan is a string, then h(w) -h(a) .h(an)