Dynamic Programming problem. Need help ASAP

A student must select eight elective Courses from four different departments, with at least one Course from each department. The Courses offered by each department are intended to maximize the "knowledge" in a particular discipline. Departments measure knowledge on a 100-point scale depending on the number of Courses taken by the student, as shown in the following chart: The student would like to select her elective Courses with the objective of maximizing the total knowledge she will gain. She has developed the following BACKWARD DYNAMIC PROGRAMMING FORMULATION: The student is unable to complete the DYNAMIC PROGRAMMING PROCEDURE and needs your help to solve the problem. (a) Complete the table in stage 3. (b) Complete the table in stage 2. (c) Complete the table in stage 1. (d) Provide the optimal number of Courses to be taken from each department and the maximum knowledge that will be gained. In your answer, you have to include the arguments (in parenthesis) of the optimal decisions and the optimal value function. If multiple optimal exist, report all optimal solutions