If $L$ is a language and $a$ is a symbol then $L/a,$ the quotient of $L$ and $a$ is the set of strings $w$ such that $wa$ is in $L$ For example, if $L=\{a,aab,baa\}$then $L/a={\in,ba}.$Prove that if $L$ is regular, so is $L/a.$ Hint $:$ Start with a DFA for $L$ and consider the set of accepting states.
