Let = {0, 1}. Consider the language A = {w | w = 0i10j where i < j and |w| is odd}. Suppose you are asked to prove that the language A is not regular, what would be the string s that has length at least p that you want to use. Note that you do not have to actually prove it. Just give me a string s.