(a) Suppose language L is accepted by FA M. Let L be the subset of L consisting of those strings in L that are of even length. Show how to convert M to an FA for L5. (b) For a language L, define L' to be the set of all strings obtained by altering at most one symbol in a string of L. Show how to convert an FA for L into one for