Two Sweeps Of Value Iteration

A three-state MDP with $\gamma = 0.9$. State $G$ is terminal with $v(G) = 0$ forever. All transitions are deterministic.

Run synchronous value iteration, $v_{k+1}(s) = \max_a \left[ r(s,a) + \gamma, v_k(s') \right]$, from $v_0 = 0$ everywhere. Give $v_2$ and the greedy action in $s_1$ after each sweep.