if anyone could help me in answerinh these problems with steps i would appreviate it!

V^((pi)i)(e) is also needed

Consider the gridworld where Left and Right actions are successful 100% of the time. Specifically, the available actions in each state are to move to the neighboring grid squares. From state a, there is also an exit action available, which results in going to the terminal state and collecting a reward of 10 . Similarly, in state e, the reward for the exit action is 1. Exit actions are successful 100% of the time. The discount factor () is 0.9 We will execute one round of policy iteration. Consider the policy i shown below, and evaluate the following quantities for this policy. Vi(a)= Vi(b)= Vi(c)= Vi(d)=