Nadia is taking 3 courses X, Y, Z, each of which is a 3 credit-hour course. she has final examinations in each but only 12 hours available to study for them. she intends to break up the 12 hours up into 3 blocks of 4 hours each and to devote 4-hour block to one particular course. her estimates of her grades based on various numbers of hours studying each course are given in the following table. Nadia will use dynamic programming to divide up her available study time so as to maximize her GPA for the semester, where A = 4, B = 3, C = 2, D = 1, F = 0 grade points. QUESTIONS: What is the optimal number of hours to devote to course Y? 4, 12 0 or 8? What is the state of the problem? Remaining available time leftTo study, the courses or the grades or none of the answer choices Which of the following would be the stages for the dynamic programming formulation? 12 hours available, the courses, the times 0, 4, 8, or 12 or the grades? Fill in the blank. This problem is a(n) _______ problem, and dynamic programming is useful for for solving such problemsAspiration, satisficing, allocation or approximation

0 hours 4 hours 8 hours 12 hours Course X D D B Course Y D C B A Course Z D B B