$Q4{?}_{(}())$

Find a finite automaton without $$ transitions and with a single final state for

$a(a+ba)(a+cb{)}^{+}c$

Find regular expressions for the following sets:

All strings Win$\{0,1{\}}^{*},n_0(W)$ is multiple of $3$

All strings in which every $0$ is followed by at least two $1\text{'}$s

All strings on $\{0,1\}$ not containing the substring $110$

All string in $a^{*}b{c}^{*}$ but not in $a^{*}bcc$