Which of the following languages are regular, context-free but not reg- ular, or non-context-free? Assume fixed alphabets and N of >1 elements. (Here a brief explanation is sufficient.) (a) L= {ewewewzee , w, W2, W3 . |w|=|w|}. (b) L= {ewewewe | e , w, W2, W3 *, |w| = |w|}. (c) L3= {ewww3e | e, w, W2, W3 *, |w1| > |w2| = |w3|}. (d) L = {ewewewzee e , w, W2, W3 ED, w| < |w| 6}. (e) L5 = {ewewewzee , w, w3 * }. (f) L6 C (EU {e, o, (,), +,*})* is the set of regular expressions over Hints: Remember that we study here regular expressions them- selves, not the regular languages they define. Consider regular expressions without abbreviations (skipped parentheses). (g) L7 C (CUNU{})* is the set of productions of all the context- free grammars with the terminal alphabet and the nonterminal alphabet N.