Let us fix the alphabet {0, 1). Define a substring of w * to be any string x such that w-uru for some u, te . Now consider the language A wE001 is not a substring of w} For example, e, 01, 1111, 10101, and 0111010101 are in A, but 10001 and 11001011 are not Consider the context-free grammar G-(ls), R, S), where the rules R are S -e 1 S 01 S Show that L(G)-A Hint: Show L(G)C A using structural induction and show A C L(G) by induction on the length of strings in A