Use the pumping lemma to show that the following languages are not context free.

1. {0ⁿ1ⁿ0ⁿ1ⁿ | n >=0}

2. {t₁# t₂#... t_k | k>=2, each t_i in {a,b}*, and t_i=t_j for some i != j}