$($ X points$)$ Consider the deterministic reinforcement environment drawn below $($let $\backslash$gamma $=0\mathrm{.}5).$ The agent can choose to follow any outgoing edge from any node and will arrive at the other end of the edge $100\%$ of the time. The numbers on the edges indicate the immediate rewards. Once the agent reaches the 'end' state the agent is magically transported to the 'start' state. A one$-$step, tabular, Q$-$learner with $\backslash$alpha $=1$ follows the path start $->$ b $->$ end. Compute the values of all entries in the Q table that change. Show your work. Assume that for all legal actions the initial values in the Q table are $6.$ When writing Q$($s$,$ a$)$ let the action be the name of the target state. For example, Q$($ start, b$)$ denotes starting in the start state and taking the action that will move to state b$.$