Show that the following languages are not regular. This can involve the pumping lemma and/or closure properties.

For reference, here is the pumping lemma game (for language A):

1. Adversary picks a number p 0.

2. You pick a string w A, such that |w| p.

3. Adversary breaks w into w = xyz, such that |xy| p and y , .

4. You pick a number i 0. If xy i z

(c) {a mb n c k | m,n, k are all distinct}

For reference, here is the pumping lemma game (for language A): 1. Adversary picks a number p 2 0. 2. You pick a string w e A, such that |wl 2 p. 3. Adversary breaks w into w-xyz, such that lxyl p and y 4. You pick a number i 2 0. If xy'z A, then you win. . If you can describe a strategy in which you always win, then A is not regular. (c) (a"b"ck | m, n, k are all distinct)