Question $3$: Using the Pumping lemma to prove that the given language is not context free. $[3$ mark$]$ Language:

$\{$a$^$m b$^$n c$^($mn$)$ :m$>=0,$ n$>=0\}\{$a$^$n b a$^(2$n$)$ b a$^(3$n$)$ : n$=>0\}\{$a$^$n b$^$n a$^$n b$^$n :n$>=0\}$ solve it as ceses