is this enumerator correct?

if not, what could be a possible solution?

(8 points) Consider the following definition of an enumerator. An enumerator is a deterministic Turing machine that does not have an accept state or a reject state. A subset of the states are print states. Whenever a computation enters a print state, the enumerator "prints" the string of all symbols on the current content of the tape from the beginning of the tape up to the first blank symbol. The only allowable input to the enumerator is the empty string (so the enumerator always starts with a tape of all blanks). (Note that this is different than how we defined it in class.) Design an enumerator that enumerates the language L(1(00)1). (include a drawing of your machine and a brief implementation level description.)