2. Give a context-free grammar to generate each of the following languages: (a) {uvwvR I u, v, we {a,brand lu1-1w/ = 2} (b) abeik, where i,j, k> 0) (c) ax IN20, xe fa, b and N). For example, s, a, aa, ab, aaa, aab, aaaa, aaab, aaba, aabb are in the language, but aabbb is not. (d) The complement of the language {a"b" |n 20) (e) The set of all strings over {num, +,-* /} which are legal binary postfix ums expressions. Thus num, num num +, num num num *-, and num num - num* are all in the language, while , num *, and num num num-are not in the language in the language, whim