context free grammar

Question

S→ aS | bS | epsilon

what is the language generated by this grammar ?

Answer 1

the language generated by this grammar is regular and  in regular expression form this grammar can be written as (a+b)*

and we know that this expression is regular hence we can say that the language generated by this grammar is regular language