Today is a dreadful night for Miguel. As a 2nd year IE student in UPLB, he will be having 3 final exam tomorrow: IE 142, IE 150, and ENSC 11. Unfortunately, he only has a total 9 hours of review time available He now wants to decide how to allocate this available time to these three subjects to maximize his total scor in the final exams of this subjects. His expected score in the finals depends on the number of hours he wi devote to each one as shown in the table below. As a rule, he should allot a minimum of 2 hours and a maximu of 5 hours to review each exam Only integer values (in hours) should be allowed. Use DP to find the optima allocation that will maximize the total of his scores in the 3 exams. Review Time Expected Score in Finals (in %) (hr) IE 150 ENSC 11 2 70 SO 3 80 65 4 85 70 5 90 75 IE 142 40 60 75 80 The following must be defined / completed to get full points. 1. Define the stage, state, alternative, and recursive function of the DP. 2. Complete the DP table. 3. Setup the mathematical expression for the recursive function. 4. Summarize the optimal allocation of available review time. Bonus Item: Formulate and solve the ILP that can solve this problem. Today is a dreadful night for Miguel. As a 2nd year IE student in UPLB, he will be having 3 final exam tomorrow: IE 142, IE 150, and ENSC 11. Unfortunately, he only has a total 9 hours of review time available He now wants to decide how to allocate this available time to these three subjects to maximize his total scor in the final exams of this subjects. His expected score in the finals depends on the number of hours he wi devote to each one as shown in the table below. As a rule, he should allot a minimum of 2 hours and a maximu of 5 hours to review each exam Only integer values (in hours) should be allowed. Use DP to find the optima allocation that will maximize the total of his scores in the 3 exams. Review Time Expected Score in Finals (in %) (hr) IE 150 ENSC 11 2 70 SO 3 80 65 4 85 70 5 90 75 IE 142 40 60 75 80 The following must be defined / completed to get full points. 1. Define the stage, state, alternative, and recursive function of the DP. 2. Complete the DP table. 3. Setup the mathematical expression for the recursive function. 4. Summarize the optimal allocation of available review time. Bonus Item: Formulate and solve the ILP that can solve this