Consider the following context-free language: L = {a^k b^m c^m d^k | k, m N}

(a) Choose a working p to satisfy the pumping lemma. (It does not need to be the shortest.)

(b) For any string, w, longer than your chosen p, show how to divide it into u, v, x, y, and z. (You might need multiple cases.)

(c) Show that the three conditions of the pumping lemma decomposition hold for your divisions.