Let L be a recursive language. Define L' = {x : there is y such that yxy belongs to L. Show that L' is r.e.