Consider the MDP, a fair coin is flipped till three consecutive heads are seen.
Draw the discrete-time Markov chain (see recycling robot example). Rubrics:
(a) 1pt states
(b) 1pt transition paths
(c) 1pt transition probabilities