Match each language on the left to the corresponding type on the right $($each language should be matched to the most restrictive type that correctly describes it$).$

Drag and drop application.

$\{0$m$1$n $|$ m $$ N$,$ n $$ N$\}$

$\{0$m$1$n$|$m$$N$,$ n$$N$\}$ drop zone empty.

$\{0$n$1$n $|$ n $$ N$\}$

$\{0$n$1$n$|$n$$N$\}$ drop zone empty.

$\{0$n$1$n$2$n $|$ n $$ N$\}$

$\{0$n$1$n$2$n $|$n$$N$\}$ drop zone empty.

regular

context$-$free

context$-$sensitive