3. [10 Points] Recognizable languages have enumerators. Suppose that language LC has recognizer machine M and consider the construction of an enumerator for L discussed in lecture 18, using the shortlex ordering 80, 81, 82, ... of *, together with clocks. A guru predicted the following table of behaviors of M on strings 50, S1, S2, . . . The table shows whether M loops on a string or else how long it takes M to accept/reject that string. So S1 S2 accepts 4 secs loops accepts 5 secs S4 S5 S3 accepts 2 secs rejects 3 secs accepts 3 sec Based on the guru's predictions, show the first 9 printouts of the enumerator.