I WILL GIVE DISLIKES $!!!$ IF ANYTHING WRONG HAPPENS IN MY QUESTION, BETTER SKIP IT$!!!($a$)$ For a language L$,$ define DROPFIRST$($L$)$ to be the language containing all strings that can be obtained by removing the first symbol of a string in L VH$12.$ Thus, DROPFIRST$($L$)=\{$x : bx $$ L$,$ for some b $\{0,1\}\}.$ Show that the class of regular languages is closed under DROPFIRST. That is if L is regular, then so is DROPFIRST$($L$).[\mathrm{.}5]($Hint: It might be easier to do a NFA here. In particular, think of adding appropriate e transitions from the start. Also, be careful and add a new start state instead of reusing old start state.