Finite automata

To do on paper

$1)$ Build an asynchronous automaton on the alphabet $\{0,1\}$ that recognizes $0*+1*$

$2)$ Determine it

$3)$ Minimize it