Let E be any P-language. Show that E is polynomial-time mapping reducible to language A = { binary string w | w does not contain substring "011" and does not contain substring "100"}