$)$ Find NFA's for the following languages:

L$1=\{2$n$1$

m$3$

k

: n$,$ m$,$ k $>=0\}$ on $=\{1,2,3\}.$

L$2=\{$ w $\{$a$,$b$,$c$\}*$

: every appearance of a in w before every appearance of c in w $\}$

L$3=\{$ w $\{$a$,$b$,$c$,$d$\}*$

: number of the last symbol in w $>1\}.$

L$4=\{$ w $\{0,1\}*$

: w contains $101$ and $0110\}$