Consider the following Markov Decision Process (MDP) with discount factory = 0.5. Upper case letters A, B, C represent states; arcs represent state transitions; lower case letters ab, ba, bc, ca, cb represent actions; signed integers represent rewards; and fractions represent transition probabilities. (45 marks) +1 ba -4 A ab 0.25 bc 0.75 -1 +4 ca +2 C cb 1. Define the state-value function V "(s) for a discounted MDP [3 marks] 2. Write down the Bellman expectation equation for state-value functions [6 marks] 3. Consider the uniform random policy l(s,a) that takes all actions from states with