Need help on theory of computation:

For reference, here is the CFL pumping lemma game (for language A): 1. Adversary picks a number p 20 2. You pick a string s eE A, such that Isl 2 p. S. Adversary breaks s into 4. You pick a number 2 0. If uwr'y A, then you win. s - uwwxy, such that lowxl s pand lux> o If you can describe a strategy in which you always win, then A is not context-free. 1. Use the pumping lemma to show that the following are not context-free. and bin(x)+1bin(y)) (a) (xcy |xy E 0 and {xcr l x {0, 1}*). How wou in that case? (b) (aibek l i