Find a regular expression for the language generated by the grammar

S $->$ abA

A $->$ bA$|$bB

B $->$ bB$|$a

Use JFLAP!

bPlease write the regular expression clearly such as : abb$*($a$+$b$)*$

where $+$represents OR and $*$ represents $0$ or more repitions. Thanks!