$1)$ Draw the state diagram for an NFA N$1$ that recognizes $0*($Language L$1)$

$2)$ Draw the state diagram for an NFA N$2$ that recognizes $1*($Language L$2)$

$3)$ Using our construction for concatenation $($from June $12),$ draw the state diagram for an NFA that recognizes L$3=$ L$1$ concatenated with L$2.$

$4)$ Using our construction for Kleene closure $($from June $12),$ draw the state diagram for an NFA that recognizes L$4=($L$3)*.$

$5)$ In simple terms, what bitstrings are in L$4?$