Homework grade maximization: In a class, there are n assignments. You have H hours to spend on all assignments, and you cannot divide an hour between assignments, but must spend each hour entirely on a single assignment. The Ith hour you spend on assignment J will improve your grade on assignment J by B[I, J], where for each J, B[1, J] ? B[2, J] ? ... ? B[H, J] ? 0. In other words, if you spend h hours on assignment i=h J, your grade will be i=1 B[i, J] and time spent on each project has diminishing returns, the next hour being worth less than the previous one. You want to divide your H hours between the assignments to maximize your total grade on all the assignments. Give an efficient algorithm for this problem.