I'm trying to use the pumping lemma proof to show that the following language is context-free rather than regular
$\{ba^n bc^n | n \geq 1\}$
I've been looking at tutorials on Youtube to try and gain an understanding but as of yet I cannot get my head around it.
Is someone able to take my example and show step by step how to solve using the lemma.
Thanks in advance,
