could you show me all the procedures?

Consider the deterministic reinforcement environment drawn below, where the current state of the Q table is indicated on the arcs. Let -09. Immediate rewards are indicated inside nodes. Once the agent reaches the 'end' state the current episode ends and the agent is magically transported to the 'start' state (R 5) 2 start R -9) (R 0) R 1) R--6) Assuming our RL agent exploits its policy (with learning turned off), what is the path it will take from start to end? Briefly explain your answer a) Answer: b) Assuming the RL agent is using one-step Q learning and moves from node a to node b Report below the changes to the graph above (only display what changes). Show your work c Show the final state of the table after a very large number of training episodes (i.e., show the Q table where the Bellman Equation is satisfied everywhere). No need to show your work nor explain your answer start Consider the deterministic reinforcement environment drawn below, where the current state of the Q table is indicated on the arcs. Let -09. Immediate rewards are indicated inside nodes. Once the agent reaches the 'end' state the current episode ends and the agent is magically transported to the 'start' state (R 5) 2 start R -9) (R 0) R 1) R--6) Assuming our RL agent exploits its policy (with learning turned off), what is the path it will take from start to end? Briefly explain your answer a) Answer: b) Assuming the RL agent is using one-step Q learning and moves from node a to node b Report below the changes to the graph above (only display what changes). Show your work c Show the final state of the table after a very large number of training episodes (i.e., show the Q table where the Bellman Equation is satisfied everywhere). No need to show your work nor explain your answer start