Pumping Lemma for Context-free Languages Use the pumping lemma to show that following language is not context-free L= {ack>m>n>0} In your proof, simply write words in ASCII text, e.g. [a^k b^m c^n. Note: This question is not automatically graded! Points will be assigned after the deadline has passed. Answer

Fig: 1