Which one of the following regular expressions correctly represents the language of the finite automaton given below?
(a) (a|b)*abb
(b) a*b*
(c) (ab)*
(d) a+b+