Please answer problem 2 at the bottom of the pict

Problem 1. Design NFAs that accept the following languages: (1) L1={0310mmN}. (2) L2={1n021m+1n,mN}. (3) L3={02m1nn,mN}. (4) L4={03m102m,N}. (5) L5={a2b3a4}. (6) L6={a3b2,ba2b3}. (7) L7={0n+21m+3m,nN}. (8) L8={0,1} on T={0,1}. (9) L9={0,1} on T{0,1}. (10) L10={} on T={0,1}. (11) L11= on T={0,1}. (12) L12={bkababmk,,mN} on T={a,b}. (13) L11={1k014k,N} on T={0,1}. Problem 2. Design an NFA that accept the following language: L=(L1L7)L3L11