Consider the following grid world. The calculated value of each state in the n$-$th iteration of the

value iteration method is given inside the cells. Suppose the discount factor $$ is equal to $1.$ The

environment is deterministic and moving in any direction results in a reward of $-1.$

Calculate the next values for each of the shaded cells for the next iteration of the Value Iteration

algorithm.