We define a removable state as a state such that if we erase the state itself and the edges that come out of it, what results is a perfectly good-looking FA.
(i) Give an example of an FA that contains a removable state.
(ii) Show that if we erase a removable state the language defined by the reduced FA is exactly the same as the language defined by the old FA.