theory of computation

Question

Answer 1

Am i correct ?

A) is TRUE and
B) is FALSE.

Comments

 give explanation also then if u have answered plzzzzzzzzzzzzz

(ab^R)*  = (ba)* = {  , ba,baba,bababa,......................................}

(ab)* = (      ,ab,abab,ababab,...........................................)

((ab)*)^R = {  , ba,baba,bababa,......................................}

---

please explain

Answer 2

actually here both are true....

second..

L1={w1,w2} here actually if we see the behaviour of the closure ..it is like ..taking a string and concatenating with same or other string.L1*=(w1w2 or w2w1 or w1w1,or w2w2....)

now (L1*^R) means reversing every string i.e reversing w1 followed by w2 and concatenate them(for w2w1)....and it is similer the procedure for finding (L1^R*)

L2={w3,w4}

....and i think first is quite clear....