Answer Happy

This is automata question. Please dont copy from other sources
and give step by step solution.
Let Σ = = {0,1} be an alphabet, L CE* a CFL and, we X* a string. Prove that the language L1 = {ve L | v does not contain 0Ow11 as subtring}