A finite automaton $($FA$)$ is an abstract machine that can be used to represent certain forms of computation in a graph that consists of states and edges from an alphabet $.$

Convert the following regular expression to finite automaton $($FA$)$:

$(b(a|)|)$

$($Look at the pic to see the regular expression better$)$