Q $1$: Write a regular expression and draw Finite automata for the following languages

$($i$)$ : each $a$ in $w$ is immediately preceded and immediately followed by a b