Given a language L and two strings x and y, we write xLy to denote that (mark all that apply) for all strings z,xzLyzL there is a string z such that xzLyz/L xL and yL xLyL there is no string z such that xzLyz/L x and y have no separating extension Mark which of the following languages are regular. {0n1nnN} {1n2nN} {12nnN} {x{0,1}#(01,x)=#(10,x)} {x{0,1}#(0,x)=#(1,x)} {www{0,1}} The pumping lemma states that for any regular language A, there is a numbering p called the pumping length, so that any string w in A with wp, w can be divided into three substrings w=xyz, such that which of the following holds? (Mark all that apply.) xz is also in A, as is xyyz,xyyyz,xyyyyz, and so on. xyz is not in A. x>0 x and y put together occur somewhere in the first p symbols of w. for all kN,xykz

0 y is not