If S and T be language over Σ = {a, b } represented by regular expression (a b * ) * and (a b) * , respectively, then

If S and T be language over Σ = {a, b } represented by regular expres

1.	If S and T be language over Σ = {a, b } represented by regular expression (a b * ) * and (a b) * , respectively, then
A.	T⊂ S
B.	S ⊂ T
C.	S ∩ T= φ
D.	S = T
Answer» E.