undefined

3. (5 points) Consider L2 = {0S#1"|S,T> 0;S > T}. Select among the ones listed below, the strings that are valid for setting up the proof to demonstrate that L2 is not regular. Assume L2 is regular, and that is the pumping length. Then, consider strings = LE L1 The string s can be decomposed into 3 substrings, x, y, z with lyl >0 and xy SP, such that sexy'z e Li for each i>o. (The rest of the proof depends on your choice of s; but remember that in this problem, you are only required to identify the string or strings that you could use in setting up the proof.] a. 00#1 b. OP#10 C. OPN#1';N>0 d. OON OP#1';N20 e. None are valid