[2 Points]

Let L be any language over alphabet { a, b}. Using L, we define a new language L' which includes every string w if both w and its reverse are in L. Show that L' is regular whenever L is regular.

L0 should be L', and the question does not mention what is w. Thanks.