theory of computation

Question

if L1 ={a^n | n>=0}

then L1^R  is?

Comments

See language is regular and we know reversal of regular language is regular. So L^R is also regular.
Actual language is L1^R ={a^n | n>=0}

---

L1^R = L1.

---

Regular languages are closed under reversal operation so L1^R will be regular.

Answer 1

L1 = a^n = L1^r

Both are same language and regular