Convert regular expression to DFA
In this case + stands for the OR-operation. So the automaton is indifferent using an $a$ transition or a $b$ transition.

It's sufficient to construct an automaton with one state which is initial and final state and having one transition labeled with a, b.