For the chain with transition matrix below, the rewards for states \(1-5\) are, respectively, \(1,0,5,2\), and 3 . Draw the transition diagram, and use your intuition to guess at the optimal stopping policy. Then solve the linear program associated with the value function of the problem to verify that your solution is correct.

Transcribed Image Text:

T= 0 0 1/3 0 000 (1/2 1/2 0 1/3 0 1/3 2/3 1/3 0 0 0 0 1 0 0 0 1 0