Suppose that an “immortal monkey” is constantly typing on a word processor that is not breakable, lasts forever, and has infinite memory. Suppose that the keyboard of the word processor hasm−1 keys, a space bar for blank spaces, and separate keys for different symbols. If each time the monkey presses one of the m symbols (including the space bar) at random, and if at the end of each line and at the end of each page the word processor advances to a new line and a new page by itself, what is the probability that the monkey eventually will produce the complete works of Shakespeare in chronological order and with no errors?