$(1+1+1+3$ points$)$ Use pumping lemma for context$-$free languages to prove the following language $L.$ over the alphabet $\{a,b\}$ is not context$-$free.

and $w$ contains equal number of $a\text{'}$s and $b\text{'}$s