where CFL is context-free language.

(20%) Show that if L is a CFL then so is K = {wi . . . . . uk . ak 1 k > 0, we L}