2. Give a context-free grammar to generate each of the following languages: C and E are the ones I need help with. I already did D.

(c) {xc" 1 xe {a, b} * and ( (x) = n or #b(x)-n). For example, bbbbb, ac, abbabcc, , a, baabbbcccc are in the language, but babac is not. (d) The complement of the language (a"b" n20 (e) All Lisp-like expressions. A Lisp expression may be an unsigned integer or a list. A list, enclosed by left and right parentheses, consists of one operator , -, *,/, max, min) followed by a sequence of at least one Lisp expression. For instance, 13, (- 8), *9 3), (( 2 2) 4), and (min (max 3 1 4) (max 271) are Lisp expressions