Let E be any P$-$language.Show that E is polynomial$-$time mapping reducible to language A$=|$ binary string ww does not containsubstring $"011"$ and does notcontain substring $"100"\}$You need to provide a polynomial$-$time mapping to reduce E to A$.$