2. (5 points) Let be an alphabet which does not contain $ . Let w be a any string over . We define Typo(w) to be the set of strings in which exactly one symbol in tv is replaced by $. Let A be any regular language over . Let B(A) = {x | x Typo(w) for any wE A). Prove B(A) is regular