I want to construct a **deterministic** finite automata that accepts the following language:

{w ∈ {a,b}\* : each a in w is immediately preceded by a b}

So far I've got >⨀ ---b---> O ---a---> O.

'>' = initial state

⨀ = final state