Are the following languages context$-$free or non$-$context$-$free?

If a language is context$-$free, give a context$-$free grammar that generates it$.$

If a language is not context$-$free, prove this using the pumping lemma.

$($a$)(2\mathrm{.}5$ marks$)A=\{a^{2i}{b}^{3i}{c}^k{d}^m|ik1,m1\}$

$($b$)(2\mathrm{.}5$ marks$)B=\{a^i{b}^k{c}^{2r}{d}^{3m}|ik1,rm1\}$