Suppose that B is a regular language over an alphabet . Let C = {w | a such that aw B}

(a) Prove that we may choose a such that |a| < p in the definition of C, where p is the pumping length of B. That is, prove that we have C = {w | a such that aw B and |a| < p}.

(b) Prove that C is regular.