Let $S$ and $T$ be languages over $\Sigma=\{a,b\}$ represented by the regular expressions $(a+b^*)^*$ and $(a+b)^*$, respectively. Which of the following is true?

Correct Option: C

$S=T$. Both generates all strings over $\Sigma$.

Option C,

S = T,

All the below forms of REX are equivalent,

(a*b*)* = (b*a*)* = (a* + b)* = (a + b*)* = (a* + b*)* = (a + b)*