For a string w = QjQ2A304050607..., define third(w) = (3260g .... Then, for a language L, define third(L) = {third(w): w L}. Show that if L is regular, then third(L) is also regular. Hint: Construct an e-NFA from the DFA for L