1. (50 pt., 10 pt. each) Construct a context-free grammar in JFLAP (version 7.1) that generates each of the following languages. For each language, you must submit one JFLAP file clearly labelled (e.g., 1a.jff). The context-free grammars submitted should not be in Chomsky normal form (CNF). Make sure that you test your grammars in JFLAP before submitting. e. E = {w#x | W,X E {a,b) and wp is a substring of x} Hint: wp is a substring of x if there are strings y, z {a,b}* such that x = = yw Rz. 1. (50 pt., 10 pt. each) Construct a context-free grammar in JFLAP (version 7.1) that generates each of the following languages. For each language, you must submit one JFLAP file clearly labelled (e.g., 1a.jff). The context-free grammars submitted should not be in Chomsky normal form (CNF). Make sure that you test your grammars in JFLAP before submitting. e. E = {w#x | W,X E {a,b) and wp is a substring of x} Hint: wp is a substring of x if there are strings y, z {a,b}* such that x = = yw Rz