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

{t1#t2# #tk| k 2, each ti {a, b}, and ti = tj for some i = j}