Consider the grid-world given below and Pacman who is trying to learn the optimal policy. If an action results in landing into one of the shaded states the corresponding reward is awarded during that transition. All shaded states are terminal states, i.e., the MDP terminates once arrived in a shaded state. The other states have the North, East, South West actions available, which deterministically move Pacman to the corresponding neighboring state (or have Pacman stay in place if the action tries to move out of the grad). Assume the discount factor n = 0.5 and the Q-learning rate a = 0.5 for all calculations. Pacman starts in state (1, 3). 3 -80 + 100 2 +25 -100 +80 1 2 3 Q-values obtained by Q-learning updates - Q(s,a) + (1 - a)Q(s.a) + a(R(s,a,s') + 7 maxa Q(s' a')). Hint: (a) What is the value of optimal value function V at the following states: V*(3,2)= V*(2,2)= V (1,3)=