2. Let E = (b, c, d}. Let M be the NFA with A-transitions accepted by 93 A b C A d start 90 91 92 Give an NFA with no 1-transitions that accepts the same language as M. Use the algorithm studied in class that takes as input an NFA with A- transitions allowed, and makes from that an NFA with no A-transitions that accepts the same language.