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

$L_1=\{2^n{1}^m{3}^k$:$n,m,k0\}on{\displaystyle \underset{?}{\overset{?}{}}}=\{1,2,3\}.$

$L_2=\{w\{a,b,c{\}}^{*}$: every appearance $ofainw$ before every appearance $ofcinw\}$

$L_3=\{w\{a,b,c,d{\}}^{*}$: number $of$ the last symbol $inw>1\}.$

$L_4=\{w\{0,1{\}}^{*}$:$w$ contains $101$ and $0110\}$