Q$5$ Value Iteration Convergence

We will consider a simple MDP that has six states, A$,$ B$,$ C$,$ D$,$ E$,$ and 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 $\backslash ($ g o $\backslash )$ is taken. If there are multiple arrows leaving a state x $,$ transitioning to each of the next states is equally likely. The state $\backslash ($ F $\backslash )$ has no outgoing arrows: once you arrive in $\backslash ($ F $\backslash ),$ you stay in F for all future times. The reward is one for all transitions, with one exception: staying in F gets a reward of zero. Assume a discount factor $\backslash (=0\mathrm{.}5\backslash ).$ 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.$)$