Let S and T be languages over ∑ = {a, b} represented

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

Lets consider the regular expressions as given in the questions:

Second, (a + b)*

⇒ (a + b*)* = (a + b*) Therefore, we can say that S = T