can anyone help me with this problem? I need tutoring.

We will conisider a simple MDP that has sox states, A, B, C, D. Exand F. Each state has a single action, go. An arrow from a state x to a state y indicates that it is possible to transition from state x to next state y when go is taker if there are multiple arrows leaving a state xi transitioning to each of the nes states is equally likely. The state F has no outgoing arrows: onceyou arrike in F, you stay in F for all future times. The reward is one for all transitions, with one exceptons staying in F gets a reward of zero. Assume a discount factor =0.5. We assume that we initialize the value of each state to 0 . (Note: you should not need to explicitly run value iteration to solve this problem.) After how many iterations of value iteration will the value for state E have become exactly equal to the true optimum? (Enter inf if the values will never become equal to the true optimal but only converge to the true optimat) Last Lavrat an fera 23 at 5.35 Pat