For any string u{0,1}, let u denote the bitwise complement of u, the string obtained by switching all 0's to 1's and 1's to 0's. For example, 0101111=1010000. Let A={uuu{0,1}}. For example, ,01,10,0011,0110,1001,1100,0000011111, 1110100010A, but 00,11,010,000,0001,0000011110,1111100001/A. Finish the following proof that A is not regular. By the Myhill-Nerode Theorem, it suffices to find an infinite set S of pairwise A-separable strings. Let S= (Finish proof below.)