Exercise $3\mathrm{.}9\mathrm{.}4$: Construct the minimum$-$state DFA's for the following regular expressions: a$)($a$|$b$)*$a$($a$|$b$).$ b$)($a$|$b$)*$a$($a$|$b$)($a$|$b$).$ c$)($a$|$b$)*$a$($a$|$b$)($a$|$b$)($a$|$b$).$ Do you see a pattern?