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 w is replaced by $. Let A be any regular language over . Let B(A)-{x | x Typo(w) for any w e A]. Prove B(A) is regular