6. Reinforcement Learning Consider the following deterministic Markov Decision Process (MDP), describing a simple robot grid world Notice the values of the immediate rewards are written next to...

Please provide the optimal policy. If there is a tie, always choose the state with the smallest index

Extracted text: 6. Reinforcement Learning Consider the following deterministic Markov Decision Process (MDP), describing a simple robot grid world Notice the values of the immediate rewards are written next to transitions. Transitions with no value have an immediate reward of 0. Assume the discount factor y = 0.8. r =50 s1 s2 s3 r=100 s4 s5 số