Give the context-free grammars that generate the following languages. a. A_1 = {a^n b^m c^k | k = n + m where n, m, k greaterthanorequalto 0} b. A_2 = {w | w = w^R, that is, w is a palindrom for w elementof {a, b}^*}