Q. 4. (2.5 point) A student taking three courses (A, B and C) wants to minimize the probability of failing all three courses. Suppose that s/he has 4 hours per week on studying. The probability of failing/passing each course depends on the number of hours s/he spends studying for the course (see Table). Use dynamic programming to determine how many hours per week the student should spend studying each course. Define stages, states and recursive function clearly. What is the optimal solution and optimal value ? Probability of Failing Course B A Hours of Study per Week 0 1 2 3 4 0.8 0.7 0.65 0.62 0.6 0.75 0.7 0.67 0.65 0.62 0.9 0.7 0.6 0.55 0.5