Regular Language

Question

State True of False

S1 :If L is regular,then the language = {uv u $\epsilon$ L ,v $\epsilon$ L^R} is Regular.

S2:If w $\epsilon$ L, where L is regular than the language {ww^R;w$\epsilon$ L} is Regular.

Comments

S2: If w ϵ L, where L is regular than the language {ww^R;wϵ L} is Regular. is false  ww^r is not Regular  but CFL.

S1: If L is regular,then the language = {uv |u ϵ L ,v ϵ L^R} is Regular. Yes Regular