Show that the following languages are context free by exhibiting context-free grammars generating each:

(a) {a^m b^n : m n}

b.{a^m b^n c^p d^q : m + n = p +q}

c. {a^m b^ : m <= 2n}