where CFL is context-free language.

Show that if L is a CFL then so is K={wi . . . . . wk . ak l k > 0, uYEL}