Let L$2=$ The language of strings with alphabet $\{$a$,$ b$,$ ;$\}$ in the format x$1$;x$2$;$...$;xn where each x is a string of $\{$a$,$ b$\},$ and each string occurs exactly twice.

Prove that L$2$ is not context$-$free