You are given an aperiodic, irreducible DTMC, with n 1 states. Put a check mark in ALL boxes that are valid (possible). Note that some rows may be empty, whereas others may have multiple check marks. (We started you off by filling in some boxes.) n is n is Transient n is Positive Recurrent Null Recurrent Glossary: mjj mean number of steps to return to j given we're in state j Pi = probability that the chain is in state i in n steps given the chain is currently in state f, probability that a chain starting in state j ever returns to state j n,limiting probability of being in state j You are given an aperiodic, irreducible DTMC, with n 1 states. Put a check mark in ALL boxes that are valid (possible). Note that some rows may be empty, whereas others may have multiple check marks. (We started you off by filling in some boxes.) n is n is Transient n is Positive Recurrent Null Recurrent Glossary: mjj mean number of steps to return to j given we're in state j Pi = probability that the chain is in state i in n steps given the chain is currently in state f, probability that a chain starting in state j ever returns to state j n,limiting probability of being in state j