Exercise 3 Now we are going to use our n-grams to generate some fake text according to a Markov model. Here's how the Markov model of order n works: A. Compute (n 1)-gram occurrence frequencies You have already done this in Exercise 2! B. Pick a starting (n 1)-gram The starting (n 1)-gram can be selected at random, or the user can specify it. C. Generate Text Now we generate text one character at a time. To do so: Look at the most recent n characters in our generated text. Say that n