In theorem 3.21 in the textbook as well as on the lecture, we showed that given a turing machine m that recognizes a language a, we can construct an enumerator e for a. (a) Explain why we do not use the following simpler algorithm for E. (b) Provide a corrected algorithm and explain why your correction fixes the 'bug" in (a).