4. (5 pts) Let 3 + be a word. Show that for all 3, the language L - r* is regular. Give an example of a such that the language: L = {uw | Sy ex*, y = uvw, u = lvl = w} is not regular. Prove your