Question: 1. Let M be a finite-state machine with n states. The input alphabet is 506. Show that for any input sequence that is long enough, the output of M must eventually be periodic. What is the maximum number of inputs before periodic output begins? What is the maximum length of a period?