$*3\mathrm{.}18$ Show that a language is decidable iff some enumerator enumerates the language in

the standard string order.

only prove in one direction $-$ if a language is decidable, then there is an enumerator that enumerates the language in standard string order.