Use pumping lemma (the way by splitting s into uvxyz) to prove that the language is not context-free (Note: prove it's not context-free, and please include all cases)

{wtw | w {0 1}*, t {0, 1}* and |w| >= 1}

{wtw | w {0,1}*, t e{0,1}* and [w] 1}