Show that L={a^n | where n is prime } is not a CFL | Pumping lemma for CFL in Theory of Computation

Show that L={a^n | where n is prime } is not a CFL.
#pumpinglemmaforcfl#pumpinglemmaforregular#TOCmrmgate

pumping lemma for context free languages ppt,Pumping Lemma (For Context Free Languages),Pumping Lemma for Cfl,Pumping Lemma for Context Free Language,pumping lemma for context free languages problems,pumping lemma for context free languages solutions,pumping lemma for regular languages ppt,pumping lemma for regular languages examples,pumping lemma examples,pumping lemma for context free languages ques10,closure properties of context free languages,