Impair (c) (5pts) If L is a language over alphabet I = {0,1} then we define Imp(L) as: Imp(L) = {W E L w has odd length} Let L1 = {4,0,1,00, 111, 1001,00000}, what is Imp(L1)? 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) (d) (5pts) If L is a language then we define DELI(L) as: DELI(L) = {uif w can be obtained by deleting one symbol of a string in L} Let L1 = {t,1,00, 101}, what is DELI(L1)? Show that the class of regular languages is closed under DELI (i.e. you need to show that for any regular language L, DEL1(L) is regular as well)