20.

Dynamic Programming question

20. Suppose it's nearing the end of the semester and you're taking n courses, each with a final project that still has to be done. Each project will be graded on the following scale: It will be assigned an integer number orn a scale of 1 to g> 1, higher numbers being better grades. Your goal, of course, is to maximize your average grade on the n projects. You have a total of H > n hours in which to work on the n projects cumulatively, and you want to decide how to divide up this time. Foir simplicity, assume H is a positive integer, and you'll spend an integer number of hours on each project. To figure out how best to divide ujp your time, you've come up with a set of functions if : 1, 2, .. . , n)(rough