2. (10 points) Prove each of the following facts. You should not need to design any new constructions for these closure proofs: use results that we have already proved (a) If we remove one string from any nonempty regular set, the resulting set is still regular (b) The subset of a regular set over fa, b, cy consisting of just those strings that don't use the symbol c is regular