Exercise $2\mathrm{.}4\mathrm{.}2$ Construct automata to accept the following languages $L_i\{0,1{\}}^{*}$:

contains at most $5$ ones

contains no $1$ followed by $0$

the number of ones is a multiple of $3$