1. In each part below, find a context-free grammar that generates the given language over the alphabet ={0,1}, and explain why your grammar works. (a) B={x:x=(x)}, where (x) is the reverse of x; i.e., if x=x1x2xn, then (x)=xnxn1x1 (b) C is the set of all binary strings which contain more 1's than 0 's