!!!Use Python!!!

[9] Double Simple Game Domain Given the same domain, convert it into a double simple game problem. In the standard simple game problem, the goal is for the agent to start in A and reach the D. In the double travelling salesman problem, the goal is for the agent to move to node D and then back to A. Convert this problem into a tabular reinforcement learning problem. Identify the states, actions, rewards and Q-values under the optimal policy for this domain assuming that discount factor y=0.9. Remember the Markov assumption for domains in reinforcement learning. [9] Double Simple Game Domain Given the same domain, convert it into a double simple game problem. In the standard simple game problem, the goal is for the agent to start in A and reach the D. In the double travelling salesman problem, the goal is for the agent to move to node D and then back to A. Convert this problem into a tabular reinforcement learning problem. Identify the states, actions, rewards and Q-values under the optimal policy for this domain assuming that discount factor y=0.9. Remember the Markov assumption for domains in reinforcement learning