Regular expressions can be used to define languages accepted by finite state machines.
One operator used in regular expressions is *, the Kleene star. It means that the symbol before it must appear 0 or more times.
For example, a*b* means 'a' zero or more times followed by 'b' zero or more time. This language includes the empty string, "a", "b", "ab", "aa", "bb", etc.
Construct a finite state machine which is accepts the language definined by the regular expression a*b*