Here is the value iteration algorithm details

function VALUE$-$ITERATION $(mdp,lon)$ returns a utility function inputs: $mdp,$ an MDP with states $S,$ actions $A(s),$ transition model $P(s^{\text{'}}|s,a),$ rewards $R(s),$ discount $$

$lon,$ the maximum error allowed in the utility of any state

local variables: $U,U^{\text{'}},$ vectors of utilities for states in $S,$ initially zero $,$ the maximum change in the utility of any state in an iteration

repeat

$,Ularr{U}^{\text{'}}$;$larr0$

for each state $sinSdo$

$,U^{\text{'}}[s]larrR(s)+ma{x}_{\text{a}\text{i}\text{n}\text{A}(s)}{\displaystyle \underset{s^{\text{'}}}{\overset{?}{}}}P(s^{\text{'}}|s,a)U[s^{\text{'}}]$

$if|U^{\text{'}}[s]-U[s]|>$ then $larr|U^{\text{'}}[s]-U[s]|$

until

return $U$

B$.$ Set discount factor between $0$ and $-1$

C$.$ Set discount factor between $0$ and $1$

D$.$ Set discount factor between $0$ and $2$