Show that a language L is Turing-decidable if and only if there is a Turing machine M that enumerates L and such that the strings in L are output by M in length-increasing fashion. (Hint: The if direction is trivial when L is finite (justify) so focus on the case when L has infinitely many strings.)