Give an FA (DFA or NFA) for the following language over alphabet = {1, y). Note the FA can be constructed by combining DFAs for simpler languages. L5 {w] has even length or an odd number of z's } (b) (5pts) Give an FA for the following language over alphabet E = {1,y). Note the FA can be constructed by combining DFAs for simpler languages. L6 = {w] has even length and an odd number of z's } (c) (5pts) Give an FA for the following language over alphabet = {1,y}. Note the FA can be constructed by combining DFAs for simpler languages. L6 = {w] has even length and does not have an odd number of z's } (d) (5pts) If I. is a language over alphabet E= {0, 1} then we define Imp(L) as: Imp(L) = {w Ll w has odd length} Let L = {e, 0, 1, 00, 111, 1001, 00000}, what is Imp(L)? Show that the class of regular languages is closed under Imp (i.e. you need to show that for any regular language L, Imp(L) is regular as well)