Using the pumping lemma for context-free languages, show that the following languages are not context free: (if this is not possible please explain why)

a) L = { wx | x is a suffix of w, x != w, |w| > 1, x and w are elements of (1 U 2 U 3)* }

sample good string:

2113232

(w is 21132, x is 32 (the last 3 characters of w))

b) L = { w0*1*z | w = z, |w| > 0, w and z are elements of (0 U 1)* }