5. Let L be a regular language on and , C The result of dropping symbols in , from a word w is denoted by w-. For instance, aabacoa- is aaaaca. Define L-5-[w : w E Ly. That is, L-5 is the result of drop- ping symbols in , from each word in L. Show that if L is a regular language. then L- is also a regular language. (Hint: use structural induction)