Suppose that there are n homework assignments, where the ith homework assignment has difficulty di > 0. All of the assignments are released on the first day of class, and you may turn in one assignment per week. you turn in assignment i on week k, then you receive (n - k)edi points. Do the following. If (a) Consider a solution in which you turn in assignment j before assignment i, even though di > dj. Show that you can increase the number of points earned by turning in assignment i before assignment j. Proof. (b) Using part (a), describe a greedy algorithm to order the assignments in order to maximize the number of points earned. Pseudo-code is not required, but you should provide enough detail that a CSCI 2270 student could reasonably be expected to implement the solution from your description. Activate Windows