Give context-free grammars generating the following languages.

^Aa. The set of strings over the alphabet {a,b} with more a’s than b’s

b. The complement of the language {aⁿbⁿ| n ≥ 0}

Ac. {w#x| wR is a substring of x for w, x ∈ {0,1}^*}

d. {x₁#x₂# · · · #x_k| k ≥ 1, each x_i ∈ {a, b}^*, and for some i and j, x_i = x^R_j