Show that the following languages are not context-free. You can use pumping lemma or closure properties or a combination.

(a) {xcy | x,y {0, 1} and bin(x) + 1 = bin(y)} Example: a string like 100111c101000 would be in this language.

(b) {aⁿ b^mc^k| k = mn}