Create a CFG that generates each of the languages below.

a. A = (w | w {alb}* has more as than bs}

b. B= { w#x | w, x {a,b}* and w^R is a substring of x}. Remember w^R is a substring of the x if there are strings y, z {alb}* such that x = yw^Rz. c.

C = {a^m b^n c^k | m, n > 0 and k = m+n}