Explanation:
i) L={(ab)2n b3m│n,m>0}is a Regular language
⇒It is a Context free language
∵L_1=(ab)2n is a Regular language
L_2=b3mis a Regular language
Concatenation of L1∙L2 is a Regular language.
(ii) L={an bm cn d2n│n≥0,m>0}
is a Context free language.
∵ S→aSdd|A
A→bAc|bcis the Context free grammar that generates the given language.
(iii) L={an bm│0≤n≤m≤2n}
is a Context free language.
∵S→aSb|aSbb|ϵ is the context free grammar that generates the language L.
(iv)L={an b2n cm│0≤n≤m}
is a Context Sensitive language.