Designing CFG that accepts $b^m a^n$ ($m ≤ n$)
You can write this language as
$$
\{ a^k b^m a^m a^\ell a^k \mid k,m,\ell \in \mathbb{N} \}.
$$
This description easily lends itself to conversion into a context-free grammar.