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 lwl 2 p. 3. Adversary breaks w into w = xyz, such that lxyl p and y 4. You pick a number i 20. Ifxyi-e A, then you win. If you can describe a strategy in which you always win, then A is not regular. 1. Show that the following languages are not regular. You can use the pumping lemma game, or you can use closure properties (or both). (d) { wE {a, b)" I w#rev(w). In this problem rev(w) denotes the reverse of w (i.e., characters put in opposite order)