"Suppose E is an enumerator for language L, as defined in Chapter 3. Furthermore, suppose E prints its strings in length-sorted order. That is, if E prints string x before string y, then |x| ≤ |y|. E may repeat strings, and it may print strings of the same length in whatever order. Show that L is decidable. (Hint: you might first consider the case that L is finite.)"