Let L be some language (not necessarily regular). Define L^R = {w | w = x^R for some x elementof L). If L^R is regular, must L be regular? Whether you think this statement is true or not, justify your