Please answer the following correctly please dont use chatgpt and another please do by yourself , I appreciate that

Let E be any P-language. Show that E is polynomial-time mapping reducible to language A; in a expression for language A = { binary string w | w does not contain substring "011"}. You need to provide a polynomial-time mapping to reduce E to A.

Please answer the bolded one from the above , use all the information. Thank you a lot