Let { a b } be the alphabet set. Write a Context free grammar CFG for each of the following languages: a) L = Language of all palindrome b) L = language of equal no of a’s and b’ c) { \ m ≠ n, m, n ∈...

Let { a b } be the alphabet set. Write a Context free grammar CFG for each of the following
languages:
a) L = Language of all palindrome
b) L = language of equal no of a’s and b’
c) { \ m ≠ n, m, n ∈ N}
d) R.E. = b(a+b)*
e) R.E. = (ab + b)*
f) R.E. = ab(ba)* + bb

please solve all the parts kindly