5. Here is a slightly complicated version to the game we discuss in the class. Suppose there are four questions Q1, Q2, Q3 and Q4, which are associated with a reward of $100, $1,000, $10, 000, and $50, 000, respectively. There is a challenger, denoted by CH. The rule is as follows: (a) CH initially is at the state Q1 and has $0 at hand; (b) When presented a question, CH will have two choices, either to quit or to accept. If to quit, CH will take all the money she has earned so far and game is over. If she accepts and passes the challenges, she will be presented by the next question; if she accepts but fails, she will get $0 and game is over; (c) The game will be over if CH passes the last question Q4 and in that case, CH will earn all the rewards over the four questions. Assume that CH knows in advance that she will pass Q1, Q2, Q3, and Q4 with respective probabilities 3/5, 1/2, 1/4, and 1/6. 5.1. Consider such a simple policy that always accepts the challenge. Please compute the value function V*. Here you should explicitly state the values VT(s) for the four states s = Q1, Q2, Q3 and Q4. (10 points) 5.2. Please compute an optimal policy * and the corresponding value function V. Again, please explicitly state the values V** (s) for the four states s = Q1, Q2, Q3 and Q4. (20 points)