Find grammars that generate the following languages:

(a) L = {a ⁿ b^m a^m bⁿ : n, m >= 0} where V = {a,b}

(b) L = {w: |w| mod 3 <= |w| mod 2} where V = {a}